面试经典150题0530

面试经典150题0530

Leetcode082 删除排序链表中的重复元素

当一个节点的后面两个节点都不为空时进行处理，先把后面第一个节点的值保存下来，然后对后面相邻的节点的值和当前保存的值进行比较，如果相邻的第二个节点和保存的值相同，处理的过程中应该从相邻的第一个节点开始。

public static ListNode deleteDuplicates(ListNode head) {
    ListNode dummy = new ListNode(101, head);
    ListNode curr = dummy;
    while (curr.next != null && curr.next.next != null){
        int val = curr.next.val;
        if(curr.next.next.val == val){
            while (curr.next != null && curr.next.val == val){
                curr.next = curr.next.next;
            }
        }
        else {
            curr = curr.next;
        }
    }
    return dummy.next;
}

Leetcode061 旋转链表

• 如果为空链表直接返回null

• 遍历链表获取链表的长度length

• 通过传入的参数k对长度取模获取旋转的长度，使用length - k % length获取处理链表的位置。

public static ListNode rotateRight(ListNode head, int k) {
    if(head == null){
        return null;
    }
    ListNode dummy = new ListNode(0, head);
    ListNode curr = dummy;
    int length = 0;
    while (curr.next != null){
        length++;
        curr = curr.next;
    }
    int pos = length - k % length;
    curr = dummy;
    while (pos-- > 0){
        curr = curr.next;
    }
    ListNode tmp = curr;
    while (curr.next != null){
        curr = curr.next;
    }
    curr.next = dummy.next;
    dummy.next = tmp.next;
    tmp.next = null;
    return dummy.next;
}

Leetcode086 分隔链表

• 新建两个头节点dummy1和dummy2分别连接小于x和大于等于x的节点
• 将小于x的链表的最后一个节点指向dummy2.next，将大于等于x的链表的最后一个节点指向null

public static ListNode partition(ListNode head, int x) {
    ListNode dummy1 = new ListNode();
    ListNode dummy2 = new ListNode();
    ListNode curr1 = dummy1, curr2 = dummy2;
    while (head != null){
        if(head.val < x){
            curr1.next = head;
            curr1 = curr1.next;
        }
        else {
            curr2.next = head;
            curr2 = curr2.next;
        }
        head = head.next;
    }
    curr2.next = null;
    curr1.next = dummy2.next;
    return dummy1.next;
}

Leetcode146 LRU缓存

https://blog.csdn.net/qq_43734400/article/details/138122492?spm=1001.2014.3001.5502