/** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */funcdeleteNode(head*ListNode,valint)*ListNode{dummy:=&ListNode{0,head}forcur:=dummy;cur.Next!=nil;cur=cur.Next{ifcur.Next.Val==val{cur.Next=cur.Next.Nextbreak}}returndummy.Next}
/** * Definition for singly-linked list. * function ListNode(val) { * this.val = val; * this.next = null; * } *//** * @param {ListNode} head * @param {number} val * @return {ListNode} */vardeleteNode=function(head,val){constdummy=newListNode(0,head);for(letcur=dummy;cur.next;cur=cur.next){if(cur.next.val==val){cur.next=cur.next.next;break;}}returndummy.next;};
1 2 3 4 5 6 7 8 91011121314151617181920
/** * Definition for singly-linked list. * public class ListNode { * public int val; * public ListNode next; * public ListNode(int x) { val = x; } * } */publicclassSolution{publicListNodeDeleteNode(ListNodehead,intval){ListNodedummy=newListNode(0,head);for(ListNodecur=dummy;cur.next!=null;cur=cur.next){if(cur.next.val==val){cur.next=cur.next.next;break;}}returndummy.next;}}