Career Cup 2.4ListPartition我这个一运行Eclpse就崩溃了，咋回事啊

1. package Chapter2;
   
2. public class partition {
   
3. 
   
4. public static void partition(MyLinkedList<Integer> list,int k){
   
5. 
   
6. 
   
7. Node<Integer> BeforeStart=null;//左边是Node的引用，这个引用哪里也没指，指向null
   
8. 
   
9. Node<Integer> BeforeEnd=null;
   
10. Node<Integer> AfterStart=null;
    
11. Node<Integer> AfterEnd=null;
    
12. Node<Integer> Node=list.head;
    
13. 
    
14. while(Node!=null){
    
15. 
    
16. if(Node.data <k){
    
17. if(BeforeStart==null){
    
18. BeforeStart=Node;
    
19. BeforeEnd=BeforeStart;
    
20. 
    
21. }else{
    
22. 
    
23. BeforeEnd.next=Node;
    
24. BeforeEnd=Node;//BeforeEnd向前移动以便下一次遍历
    
25. 
    
26. 
    
27. }
    
28. }
    
29. 
    
30. else{
    
31. 
    
32. if(AfterStart==null){
    
33. AfterStart=Node;
    
34. AfterEnd=AfterStart;
    
35. 
    
36. }else{
    
37. 
    
38. AfterEnd.next=Node;
    
39. AfterEnd=Node;//AfterEnd向前移动以便下一次遍历
    
40. 
    
41. 
    
42. }
    
43. 
    
44. }
    
45. 
    
46. Node=Node.next;
    
47. 
    
48. 
    
49. 
    
50. 
    
51. 
    
52. 
    
53. 
    
54. }
    
55. 
    
56. BeforeEnd.next=AfterStart;}
    
57. 
    
58. 
    
59. 
    
60. public static void main(String[] args) {
    
61. MyLinkedList<Integer> list = new MyLinkedList<>(new Integer[] { 1, 2,
    
62. 6,8,2,4,9,7});
    
63. list.print();
    
64. partition(list, 9);
    
65. list.print();
    
66. }
    
67. 
    
68. }
    
69. 
    
70. 
    
71. 
    
72. 
    
73. 
    

复制代码

Node.java

1. package Chapter2;
   
2. 
   
3. public class Node<T> {  //T可以是int，string等
   
4. public T data;
   
5. public Node<T> next;
   
6. public Node(T d, Node<T> n){
   
7. data = d;
   
8. next = n;
   
9. }
   
10. }
    

复制代码

MyLikedList.JAVA

1. package Chapter2;
   
2. 
   
3. //Singly Linked List
   
4. public class MyLinkedList<T> {
   
5. public Node<T> head;
   
6. 
   
7. public MyLinkedList(Node<T> h) {
   
8. head = h;
   
9. }
   
10. 
    
11. public MyLinkedList(T[] dataArray) {
    
12. if (dataArray == null || dataArray.length <= 0)
    
13. return;
    
14. head = new Node<>(dataArray[0], null);
    
15. Node<T> node = head;//node指向head
    
16. for (int i = 1; i < dataArray.length; i++) {
    
17. node.next = new Node<T>(dataArray[i], null);
    
18. node = node.next;
    
19. }
    
20. }
    
21. 
    
22. public void print() {
    
23. Node<T> cur = head;
    
24. while (cur != null) {
    
25. System.out.print(cur.data);
    
26. if (cur.next != null) {
    
27. System.out.print(" -> ");
    
28. }
    
29. cur = cur.next;
    
30. }
    
31. System.out.println();
    
32. }
    
33. }
    

复制代码