forked from onkardighe/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
_0019_Remove_Nth_Node_From_End_of_List.java
68 lines (59 loc) · 1.44 KB
/
_0019_Remove_Nth_Node_From_End_of_List.java
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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
// https://leetcode.com/problems/remove-nth-node-from-end-of-list/
public class _0019_Remove_Nth_Node_From_End_of_List {
public static void main(String[] args)
{
// Creating Linked List
int[] arr = {1,2,3,4,5};
int n = 5;
ListNode head = new ListNode(arr[0]);
ListNode temp = head;
for(int i = 1; i < arr.length; i++)
{
temp.next = new ListNode(arr[i]);
temp = temp.next;
}
//
Solution obj = new Solution();
head.print(head);
head = obj.removeNthFromEnd(head, n);
head.print(head);
}
}
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
int size = getSize(head);
// only one element
if(size == 1 && n >= size)
{
return null;
}
// for first element
if((size - n) < 1)
{
head = head.next;
return head;
}
ListNode temp = head;
int i = 1;
while(i < size-n)
{
temp = temp.next;
i++;
}
if(temp != null)
{
temp.next = temp.next.next;
}
return head;
}
public int getSize(ListNode head)
{
int ans = 0;
while(head != null)
{
ans++;
head = head.next;
}
return ans;
}
}