GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Algorithm/java/coding/removeNthNode.java at master · lelea2/Algorithm Expand file tree/ Copy pathremoveNthNode.javaMore file actions 28 lines (21 loc) · 493 Bytes / Copy pathremoveNthNode.javaFile metadata and controls28 lines (21 loc) · 493 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 /** * Remove nth node from the end of the list */ //Walking the list with 2 pointer //Walk first pointer to nth position first //Then walk 2 pointers in parallel public ListNode removeNthFromEnd(ListNode head, int n) { ListNode p = new ListNode(-1); p.next = head; ListNode q = head; head = p; for(int i=0; i<n; i++) { q = q.next; } while(q != null) { q = q.next; p = p.next; } p.next = p.next.next; return head.next; } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |