@@ -0,0 +1,581 @@
+public class Solution %7B%0A   public ListNode removeNthFromEnd(ListNode head, int n) %7B%0A        int length = 0;%0A        ListNode cur = head;%0A        while (cur != null) %7B%0A            length++;%0A            cur = cur.next;%0A        %7D%0A        if (length == n) %7B%0A            return head.next;%0A        %7D%0A        int target = length - n -1;%0A        if (target %3C 0) %7B%0A            return null;%0A        %7D%0A        cur = head;%0A        while (target %3E 0) %7B%0A            cur = cur.next;%0A            target--;%0A        %7D%0A        %0A        cur.next = cur.next.next;%0A        %0A        return head;%0A    %7D%0A%7D%0A

Add LeetCode0019.java