代码随想录算法训练营Day3/60

203.移除链表元素

题目链接：203.移除链表元素
链表的定义差点整忘了，补一补。更喜欢设置虚拟头节点进行操作。故下面为设置虚拟节点的解题。

public ListNode removeElements(ListNode head, int val) {
    if (head == null) {
        return head;
    }
    ListNode a = new ListNode(-1, head);
    ListNode pre = a;
    ListNode cur = head;
    while (cur != null) {
        if (cur.val == val) {
            pre.next = cur.next;
        } else {
            pre = cur;
        }
        cur = cur.next;
    }
    return a.next;
}

707.设计链表

题目链接：707.设计链表
太多了太多了，先写个单链表的！双链表等等。

//单链表
class ListNode {
    int val;
    ListNode next;
    ListNode(){}
    ListNode(int val) {
        this.val=val;
    }
}
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 currentNode = head;
        
        for (int i = 0; i <= index; i++) {
            currentNode = currentNode.next;
        }
        return currentNode.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;
        }
        if (index < 0) {
            index = 0;
        }
        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;
    }

    //删除第index个节点
    public void deleteAtIndex(int index) {
        if (index < 0 || index >= size) {
            return;
        }
        size--;
        if (index == 0) {
            head = head.next;
	    return;
        }
        ListNode pred = head;
        for (int i = 0; i < index ; i++) {
            pred = pred.next;
        }
        pred.next = pred.next.next;
    }
}

206.反转链表

题目链接：206.反转链表
同样，毕设忙忙，后面补递归。
这是双指针，注意一下while，然后一溜下去，搞定。

class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode prev = null;
        ListNode cur = head;
        ListNode temp = null;
        while (cur != null) {
            temp = cur.next;
            cur.next = prev;
            prev = cur;
            cur = temp;
        }
        return prev;
    }
}