LeetCode/Question19.java at main · SULPHURIC4CID/LeetCode · GitHub

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
/*

Author: Ananthanarayanan R

Section: Algorithms
Question: 19

*/
/*

TestCases-


*/
public class Question19
{

	public static ListNode removeNthFromEnd(ListNode head, int n)
	{
		ListNode temp = head;
		ListNode headTemp = head;
		boolean flag = true;
		int count = 0;
		while(temp.next!=null)
		{
			count++;
			temp = temp.next;
		}
		count++;
		n = count - n + 1;
		count= 1;

		if(n==count)
			return head.next;

		while(head.next!=null)
		{
			if(n==count)
			{
				temp.next = head.next;
				flag = false;
				break;
			}
			count++;
			temp = head;
			head = head.next;
		}
		if(flag)
			temp.next = head.next;
		return headTemp;
    }

	public static void main(String[] args)
	{
		System.out.println("Main Method starts");
		ListNode head = LinkedList.createLinkedList(10,"unsorted");
		LinkedList.displayLinkedList(head);
		int n = 1;
		ListNode head2 = removeNthFromEnd(head,n);
		LinkedList.displayLinkedList(head2);
	}
}