代码随想录打卡第三天|203.移除链表元素，设计链表，206. 反转链表

代码随想录打卡第三天|203.移除链表元素

203. 移除链表元素

//用pre
	//不设置虚拟头节点
	 class Solution {
    public ListNode removeElements(ListNode head, int val) {
        while(head != null && head.val == val){
            head = head.next;
        }
        if(head == null)return head;
        ListNode cur = head.next;
        ListNode pre = head;
        while(cur != null){
            if(cur.val == val){
                pre.next = cur.next;
            }else{
                pre = cur;
            }
            cur = cur.next;
        }
        return head;
    }
}
	//设置虚拟头节点
class Solution {
    public ListNode removeElements(ListNode head, int val) {
        ListNode newHead = new ListNode(0,head);
        ListNode cur = newHead;
        ListNode pre = newHead;
        while(cur != null){
            if(cur.val == val){
                pre.next = cur.next;
            }else{
                pre=cur;
            }
            
            cur = cur.next;
            
        }
        return newHead.next;
    }
}
//不用pre
	//设置虚拟头节点
class Solution {
    public ListNode removeElements(ListNode head, int val) {
        ListNode newHead = new ListNode(0,head);
        ListNode cur = newHead;
        while(cur != null && cur.next != null){
            while(cur.next != null&&cur.next.val == val){
                cur.next=cur.next.next;
            }
            cur = cur.next;
        }
        return newHead.next;
    }
}
//递归
class Solution {
    public ListNode removeElements(ListNode head, int val) {
        if (head == null) {
            return head;
        }
        head.next = removeElements(head.next, val);
        return head.val == val ? head.next : head;
    }
}

（递归，迭代，迭代，递归：道爷，我真的分不清😭😭😭）

设计链表

class MyLinkedList {
    int size;
    ListNode head;

    public MyLinkedList() {
        size = 0;
        head = new ListNode(0);
    }

    public int get(int index) {
        if (index < 0 || index >= size) {
            return -1;
        }
        ListNode cur = head;
        for (int i = 0; i <= index; i++) {
            cur = cur.next;
        }
        return cur.val;
    }

    public void addAtHead(int val) {
        addAtIndex(0, val);
    }

    public void addAtTail(int val) {
        addAtIndex(size, val);
    }

    public void addAtIndex(int index, int val) {
        if (index > size) {
            return;
        }
        index = Math.max(0, index);
        size++;
        ListNode pred = head;
        for (int i = 0; i < index; i++) {
            pred = pred.next;
        }
        ListNode toAdd = new ListNode(val);
        toAdd.next = pred.next;
        pred.next = toAdd;
    }

    public void deleteAtIndex(int index) {
        if (index < 0 || index >= size) {
            return;
        }
        size--;
        ListNode pred = head;
        for (int i = 0; i < index; i++) {
            pred = pred.next;
        }
        pred.next = pred.next.next;
    }
}

class ListNode {
    int val;
    ListNode next;

    public ListNode(int val) {
        this.val = val;
    }
}

206. 反转链表

//迭代：
class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode pre = null;
        ListNode cur = head;
        ListNode next = null;
        while(cur != null){
            next = cur.next;
            cur.next = pre;
            pre = cur;
            cur = next;
        }
        return pre;
    }
}
//递归一：
class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode newHead= reverseListHelper(head,null);
        return newHead;
    }
    ListNode reverseListHelper(ListNode cur,ListNode pre){
        if(cur == null)return pre;
        ListNode next = cur.next;
        cur.next = pre;
        return reverseListHelper(next,cur);
    }
}
//递归二：
class Solution {
    public ListNode reverseList(ListNode head) {
        if (head == null || head.next == null) {
            return head;
        }
        ListNode newHead = reverseList(head.next);
        head.next.next = head;
        head.next = null;
        return newHead;
    }
}