LeetCode: Remove Nth Node From End of List

一次过

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *removeNthFromEnd(ListNode *head, int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<ListNode *> S;
        ListNode *tmp = head;
        while (tmp) {
            S.push_back(tmp);
            tmp = tmp->next;
        }
        S.push_back(NULL);
        int size = S.size();
        if (size < n+2) return head->next;
        S[size-n-2]->next = S[size-n];
        return head;
    }
};

 C#

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode RemoveNthFromEnd(ListNode head, int n) {
        List<ListNode> S = new List<ListNode>();
        ListNode tmp = head;
        while (tmp != null) {
            S.Add(tmp);
            tmp = tmp.next;
        }
        S.Add(null);
        int c = S.Count;
        if (c < n + 2) return head.next;
        S[c - n - 2].next = S[c - n];
        return head;
    }
}