-
Notifications
You must be signed in to change notification settings - Fork 0
/
B携程链表partition1.java
75 lines (68 loc) · 1.97 KB
/
B携程链表partition1.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
69
70
71
72
73
74
75
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Main {
public static class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
next = null;
}
}
/*请完成下面这个函数,实现题目要求的功能
******************************开始写代码******************************/
static ListNode partition(ListNode head, int m) {
LinkedList<Integer> list1 = new LinkedList<>();
LinkedList<Integer> list2 = new LinkedList<>();
ListNode temp = head;
while (head != null){
if(head.val < m){
list1.add(head.val);
}else {
list2.add(head.val);
}
head= head.next;
}
head = temp;
for(int i = 0; i < list1.size();i++){
head.val = list1.get(i);
head = head.next;
}
for(int i = 0; i < list2.size();i++){
head.val = list2.get(i);
head = head.next;
}
return temp;
}
/******************************结束写代码******************************/
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
ListNode head = null;
ListNode node = null;
int m = in.nextInt();
while (in.hasNextInt()) {
int v = in.nextInt();
if (head == null) {
node = new ListNode(v);
head = node;
} else {
node.next = new ListNode(v);
node = node.next;
}
}
head = partition(head, m);
if (head != null) {
System.out.print(head.val);
head = head.next;
while (head != null) {
System.out.print(",");
System.out.print(head.val);
head = head.next;
}
}
System.out.println();
}
}