题目:https://leetcode.com/problems/number-of-1-bits/
思路:
Nothing
Code:
public ListNode removeElements(ListNode head, int val) {
while(head != null && head.val==val){
head = head.next;
}
if(head == null) return head;
ListNode pre = head;
ListNode next = head.next;
while(next!=null){
if(next.val==val){
next = next.next;
pre.next = next;
continue;
}
pre = next;
next = next.next;
}
return head;
}
备注: