-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathJMain.java
51 lines (43 loc) · 1.16 KB
/
JMain.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
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class JMain {
public static void main(String[] args) {
JSolution jsolution= new JSolution();
int []nums={2,2,2,2,2};
int target=8;
String s="23";
System.out.println(jsolution.fourSum(nums,target));
}
}
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 JSolution {
public ListNode removeNthFromEnd(ListNode head, int n) {
ArrayList<ListNode> list= new ArrayList<ListNode>();
ListNode t=head;
while(t!=null){
list.add(t);
t=t.next;
}
int listLen= list.size();
if(n==listLen){
return list.get(1);
}else if(n==1){
t=list.get(listLen-n-1);
t.next=null;
return head;
}else{
t = list.get(listLen-n-1);
t.next=list.get(listLen-n).next;
return head;
}
}
}