代码随想录第三天 链表

移除链表元素 leetcode203

重点是利用虚拟头结点

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

设计链表 leetcode707

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) {
        ListNode newNode = new ListNode(val);
        newNode.next = head.next;
        head.next = newNode;
        size++;
    }

    public void addAtTail(int val) {
        ListNode newNode = new ListNode(val);
        ListNode cur = head;
        while(cur.next != null){
            cur = cur.next;
        }
        cur.next = newNode;
        size++;
    }

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

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

反转链表 leetcode206

//双指针
//时间复杂度: O(n)
//空间复杂度: O(1)
class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode pre = null;
        ListNode cur = head;
        ListNode temp = null;
        while(cur != null){
            //储存cur的下一位
            temp = cur.next;
            //cur指向前一位（pre）
            cur.next = pre;
            //pre移动到cur的位置
            pre = cur;
            //cur移动到下一位
            cur = temp;
        }
        return pre;
    }
}

//递归
//时间复杂度: O(n), 要递归处理链表的每个节点
//空间复杂度: O(n), 递归调用了 n 层栈空间
class Solution {
    public ListNode reverseList(ListNode head) {
        return reverse(null, head);
    }

    private ListNode reverse(ListNode prev, ListNode cur) {
        if (cur == null) {
            return prev;
        }
        ListNode temp = null;
        temp = cur.next;// 先保存下一个节点
        cur.next = prev;// 反转
        // 更新prev、cur位置
        // prev = cur;
        // cur = temp;
        return reverse(cur, temp);
    }
}