代码随想录算法训练营第三天 | 链表

203.移除链表元素

基础题，移除链表结点常用dummy node定位返回值（以免删去头节点无法返回）

public ListNode removeElements(ListNode head, int val) {
    if (head == null) return head;
    ListNode dummy = new ListNode(0);
    dummy.next = head;
    ListNode prev = dummy, curr = head;
    while(curr != null){
        if (curr.val == val) prev.next = curr.next;
        else prev = prev.next;
        curr = curr.next;
    }
    return dummy.next;
}

707.设计链表

需要注意void方法检查edge case之后使用return来避免接下来的程序执行

addAtIndex方法中，index需要在break point之后进行index--操作，避免跳出loop之后的index检测问题

class MyLinkedList {
    
    Node head; 

    public MyLinkedList() {
        this.head = null;
    }
    
    public int get(int index) {
        if (head == null) return -1;
        Node curr = head;
        while(curr != null){
            if (index == 0) return curr.val;
            curr = curr.next;
            index--;
        }
        return -1;
    }
    
    public void addAtHead(int val) {
        Node newNode = new Node(val);
        newNode.next = head;
        head = newNode;
    }
    
    public void addAtTail(int val) {
        if (head == null) {
            head = new Node(val);
            return;
        }
        Node curr = head;
        while(curr.next != null) curr = curr.next;
        curr.next = new Node(val);
    }
    
    public void addAtIndex(int index, int val) {
        if (index == 0){
            addAtHead(val);
            return;
        }
        Node curr = head;
        Node prev = new Node(0);
        prev.next = curr;
        while(index > 0){
            if (curr == null) break;
            prev = prev.next;
            curr = curr.next;
            index--;
        }
        if (index == 0){
            Node newNode = new Node(val);
            prev.next = newNode;
            newNode.next = curr;
        }
    }
    
    public void deleteAtIndex(int index) {
        if (head == null) return;
        Node curr = head;
        Node dummy = new Node(0);
        Node prev = dummy;
        prev.next = curr;
        while(index > 0){
            if (curr == null) break;
            curr = curr.next;
            prev = prev.next;
            index--;
        }
        if (curr != null){
            prev.next = curr.next;
        }
        head = dummy.next;
    }
    
    class Node{
        int val;
        Node next;
        
        public Node(int val){
            this.val = val;
            this.next = null;
        }
    }
}

206.反转链表

反转过程中保持记录链表两段的起点和curr的下一个节点位置

public ListNode reverseList(ListNode head) {
    if (head == null || head.next == null) return head;
    ListNode prev = null;
    ListNode curr = head;
    while(curr != null){
        ListNode next = curr.next;
        curr.next = prev;
        prev = curr;
        curr = next;
    }
    return prev;
}