/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head == null){
return head;
}
ListNode newHead = head;
while(newHead.next != null){
if(newHead.val == newHead.next.val){
newHead.next = newHead.next.next;
}
else {
newHead = newHead.next;
}
}return head;
}
}
Note: Isme ham head.next isliye kar rhe hai kyo ki ham head != null ka wait nhi kar sakte
kyu ki null me kabhi data hota hi nhi hai aur na hi null ke bad koi next hota hai.
Comments
Post a Comment