LeetCode/RemoveNthNode.java at master · Orio77/LeetCode · GitHub

History

43 lines (39 loc) · 983 Bytes

Raw

/**

* Definition for singly-linked list.

* public class ListNode {

* int val;

* ListNode next;

* ListNode() {}

* ListNode(int val) { this.val = val; }

* ListNode(int val, ListNode next) { this.val = val; this.next = next; }

* }

class Solution {

public ListNode removeNthFromEnd(ListNode head, int n) {

int length = findLength(head);

int i = 0;

int traverseTill = length - n - 1;

if (traverseTill == -1) {

return head.next;

}

ListNode curr = head;

while (i < traverseTill) {

curr = curr.next;

i++;

}

curr.next = curr.next.next;

return head;

}

public int findLength(ListNode head) {

int count = 0;

if (head == null) {

return count;

}

ListNode curr = head;

while (curr != null) {

count++;

curr = curr.next;

}

return count;

}

LeetCode/RemoveNthNode.java at master · Orio77/LeetCode · GitHub

Expand file tree

Breadcrumbs

RemoveNthNode.java

Latest commit

History

Breadcrumbs

RemoveNthNode.java

File metadata and controls