LeetCode 算法入门 Day5 双指针 Java

876. 链表的中间结点

问题描述:

 代码:

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode middleNode(ListNode head) {
            ListNode cur = head;
            int n=0,k=0;
            while(cur!=null){
                ++n;
                cur=cur.next;
            }
            cur = head;
            while(k <n/2){
                k++;
                cur=cur.next;
            }

        return cur;
    }
}

思路:

19. 删除链表的倒数第 N 个结点

题目描述:

代码:

class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode dummy = new ListNode(0, head);
        int length = getLength(head);
        ListNode cur = dummy;
        for (int i = 1; i < length - n + 1; ++i) {
            cur = cur.next;
        }
        cur.next = cur.next.next;
        ListNode ans = dummy.next;
        return ans;
    }

    public int getLength(ListNode head) {
        int length = 0;
        while (head != null) {
            ++length;
            head = head.next;
        }
        return length;
    }
}

 思路: