Leetcode Note: Linked List Easy Section Part 1

Reverse Linked List

描述：Reverse a singly linked list.

解析：反转一个链表，基础中的基础，不解释

代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode reverseList(ListNode head) {

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

Remove Linked List Elements

 

描述：

Remove all elements from a linked list of integers that have value val.

Example
Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
Return: 1 --> 2 --> 3 --> 4 --> 5

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

解析：也是基础，遍历链表并删除val为特定值的node，需要注意删除头节点的情况

代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode removeElements(ListNode head, int val) {
        if(head==null)return null;
        
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        ListNode pre = dummy;
        ListNode curr = head;
        
        while(curr!=null)
        {
            if(curr.val==val)
            {pre.next = curr.next;curr = curr.next;}
            else
            {pre = pre.next;curr = curr.next;}
        }
        return dummy.next;
    }
}

Remove Nth Node From End of List

描述：

Given a linked list, remove the nth node from the end of list and return its head.

For example,

   Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the linked list becomes 1->2->3->5.

Note:
Given n will always be valid.
Try to do this in one pass.

解析：可以两个指针操作，第一个比第二个快n步，第一个到达末尾时根据第二个指针的位置定位需要删除的节点，注意需要删除头结点的情况

代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        if(head==null||head.next==null)return null;
        
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        ListNode fast = dummy;
        
        for(int i=0;i<n;i++)
            fast = fast.next;
        ListNode slow = dummy;
        
        while(fast.next!=null)
        {
            fast = fast.next;
            slow = slow.next;
        }
        
        slow.next = slow.next.next;
        return dummy.next;
    }
}