Java solution 1ms \u5bb9\u6613\u7406\u89e3
//\u8fd8\u662f\u8d70\u7684\u5feb\u7684\u70b9(fastNode)\u4e0e\u8d70\u5f97\u6162\u7684\u70b9(slowNode)\u8def\u7a0b\u5dee\u7684\u95ee\u9898\n    \tpublic static Li
    //\u8fd8\u662f\u8d70\u7684\u5feb\u7684\u70b9(fastNode)\u4e0e\u8d70\u5f97\u6162\u7684\u70b9(slowNode)\u8def\u7a0b\u5dee\u7684\u95ee\u9898\n    \tpublic static ListNode removeNthFromEnd(ListNode head, int n) {\n            ListNode headNode = new ListNode(9527);\n            headNode.next = head;\n            ListNode fastNode = headNode;\n            ListNode slowNode = headNode;\n            while(fastNode.next != null){\n            \tif(n <= 0)\n            \t\tslowNode = slowNode.next;\n            \tfastNode = fastNode.next;\n            \tn--;\n            }\n            if(slowNode.next != null)\n            \tslowNode.next = slowNode.next.next;\n            return headNode.next;\n        }
[]