Berkeley CS 61B Data Structures(in Java) Homework5 加分+讨论帖

L.r_yoga 发表于 2015-10-14 08:36
part I 太长就没传截图，part II见下~
果然基础弱>_

有错误的话就会throw exception，程序就停止了。
就像经常会出现的NullPointerException

edwin1992 发表于 2015-7-27 13:04
请问Set.java应该放在哪里啊？我用的Eclipse，感觉应该放在list 这个package之外，我又新建了个project，然 ...

eclipse每次建立一个java project就有一个default package，那里面就放的是Set.java，然后你在你的项目src那里create new package，就可以放list package了！
其实你在workspace文件夹里面也看的出来，src文件夹里面是一个set.java程序和一个list文件夹，list文件夹里面再放的其他java 程序

虽然运行结果和答案一样，但是我知道我好些边界条件没有考虑到！！！！头都昏了！！！每次也只能考虑到最普通的情况，一想到各种特殊情况就头脑混乱！！！怎么办啊？？！！！！
开始还打算在set.java里调用head prev next这些，后面才发现，原来它们是protected，由于不在一个package里面，所以不能用。囧囧囧囧囧囧囧囧囧囧囧囧囧囧

Homework5凑字数啊

An empty list should be [  ]: [  ]
l.isEmpty() should be true: true
l.length() should be 0: 0
Finding front node p of l.
p.isValidNode() should be false: false
p.item() should throw an exception, and did.
p.setItem() should throw an exception, and did.
p.next() should throw an exception, and did.
p.prev() should throw an exception, and did.
p.insertBefore() should throw an exception, and did.
p.insertAfter() should throw an exception, and did.
p.remove() should throw an exception, and did.
Finding back node p of l.
p.isValidNode() should be false: false
p.item() should throw an exception, and did.
p.setItem() should throw an exception, and did.
p.next() should throw an exception, and did.
p.prev() should throw an exception, and did.
p.insertBefore() should throw an exception, and did.
p.insertAfter() should throw an exception, and did.
p.remove() should throw an exception, and did.
l after insertFront(10) should be [  10  ]: [  10  ]
l is a list of 3 elements: [  1  2  3  ]
n.item() should be 1: 1
n.item() should be 2: 2
n.item() should be 2: 2
n.item() should be 4: 4
n.item() should be 3: 3
n.item() should be 6: 6
After doubling all elements of l: [  2  4  6  ]
p.isValidNode() should be false: false
p.item() should throw an exception, and did.
p.setItem() should throw an exception, and did.
p.next() should throw an exception, and did.
p.prev() should throw an exception, and did.
p.insertBefore() should throw an exception, and did.
p.insertAfter() should throw an exception, and did.
p.remove() should throw an exception, and did.
n.item() should be 6: 6
n.item() should be 12: 12
n.item() should be 4: 4
n.item() should be 8: 8
n.item() should be 2: 2
n.item() should be 4: 4
After doubling all elements of l again: [  4  8  12  ]
p.isValidNode() should be false: false
p.item() should throw an exception, and did.
p.setItem() should throw an exception, and did.
p.next() should throw an exception, and did.
p.prev() should throw an exception, and did.
p.insertBefore() should throw an exception, and did.
p.insertAfter() should throw an exception, and did.
p.remove() should throw an exception, and did.
Removing middle element (8) of l: 8
l is now: [  4  12  ]
p.isValidNode() should be false: false
p.item() should throw an exception, and did.
p.setItem() should throw an exception, and did.
p.next() should throw an exception, and did.
p.prev() should throw an exception, and did.
p.insertBefore() should throw an exception, and did.
p.insertAfter() should throw an exception, and did.
p.remove() should throw an exception, and did.
Removing end element (12) of l: 12
l is now: [  4  ]
p.isValidNode() should be false: false
p.item() should throw an exception, and did.
p.setItem() should throw an exception, and did.
p.next() should throw an exception, and did.
p.prev() should throw an exception, and did.
p.insertBefore() should throw an exception, and did.
p.insertAfter() should throw an exception, and did.
p.remove() should throw an exception, and did.
Removing first element (4) of l: 4
l is now: [  ]
p.isValidNode() should be false: false
p.item() should throw an exception, and did.
p.setItem() should throw an exception, and did.
p.next() should throw an exception, and did.
p.prev() should throw an exception, and did.
p.insertBefore() should throw an exception, and did.
p.insertAfter() should throw an exception, and did.
p.remove() should throw an exception, and did.
成功构建 (总时间: 3 秒)

终于弄出来了。。。

Part I is easy.
My test cases for Part II:
System.out.println("-------Test Insert-------");
Set s = new Set();
System.out.println("Empty set s should be {  } and s = " + s);
s.insert(new Integer(3));
System.out.println("Insert 3, then Set s should be { 3 } and s = " + s);
s.insert(new Integer(6));
System.out.println("Insert 6, then Set s should be { 3  6 } and s = " + s);
s.insert(new Integer(3));
System.out.println("Insert 3, then Set s should be { 3  6 } and s = " + s);
s.insert(new Integer(5));
System.out.println("Insert 5, then Set s should be { 3  5  6 } and s = " + s);
System.out.println();
Set s2 = new Set();
s2.insert(new Integer(4));
s2.insert(new Integer(5));
s2.insert(new Integer(5));
System.out.println("Insert 4, 5, 5 to empty Set s2, then s2 should be { 4  5 } and s2 = " + s2);
Set s3 = new Set();
s3.insert(new Integer(5));
s3.insert(new Integer(3));
s3.insert(new Integer(8));
System.out.println("Insert 5, 3, 8 to empty Set s3, then s3 should be { 3  5  8 } and s3 = " + s3);
System.out.println("-------Test union-------");
s.union(s2);
System.out.println("After s.union(s2), s should be { 3  4  5  6 } and s = " + s);
Set s4 = new Set();
s.union(s4);
System.out.println("After s unions empty Set s4, s should be { 3  4  5  6 } and s = " + s);
s4.union(s2);
System.out.println("After s4 unions s2, s4 should be { 4  5 } and s4 = " + s4);
System.out.println("-------Test intersect-------");
s.intersect(s3);
System.out.println("After s.intersect(s3), s should be { 3  5 } and s = " + s);
Set s5 = new Set();
s.intersect(s5);
System.out.println("After s intersects empty Set s5, s should be {  } and s = " + s);
s5.intersect(s);
System.out.println("After s5.intersect(s), s5 should be {  } and s5 = " + s5);
System.out.println("-------Test cardinality-------");
System.out.println("Set s3.cardinality() should be 3 and s3.cardinality() = " + s3.cardinality());
System.out.println("Set s.cardinality() should be 0 and s.cardinality() = " + s.cardinality());

这次作业写了挺久的……partII里面的遇到各种bug，果然基础差
另外，我的PartII部分测试代码

1.     Set s = new Set();
   
2.     s.insert(new Integer(3));
   
3.     s.insert(new Integer(4));
   
4.     s.insert(new Integer(3));
   
5.     System.out.println("Set s = " + s);
   
6. 
   
7.     Set s2 = new Set();
   
8.     s2.insert(new Integer(4));
   
9.     s2.insert(new Integer(5));
   
10.     s2.insert(new Integer(5));
    
11.     System.out.println("Set s2 = " + s2);
    
12. 
    
13.     Set s3 = new Set();
    
14.     s3.insert(new Integer(5));
    
15.     s3.insert(new Integer(3));
    
16.     s3.insert(new Integer(8));
    
17.     System.out.println("Set s3 = " + s3);
    
18. 
    
19. 
    
20.     s.union(s2);
    
21.     System.out.println("After s.union(s2), s = " + s);
    
22. 
    
23.     s.union(s3);
    
24.     System.out.println("After s.union(s3), s = " + s);
    
25. 
    
26. 
    
27.     Set s4 = new Set();
    
28.     s4.insert(new Integer(3));
    
29.     s4.insert(new Integer(2));
    
30.     s4.insert(new Integer(1));
    
31.     System.out.println("Set s4 = " + s4);
    
32. 
    
33.     Set s5 = new Set();
    
34.     System.out.println("Set s5 = " + s5);
    
35. 
    
36.     s4.union(s5);
    
37.     System.out.println("After s4.union(s5), s4 = " + s4);
    
38. 
    
39.     Set s6 = new Set();
    
40.     System.out.println("Set s6 = " + s6);
    
41. 
    
42.     Set s7 = new Set();
    
43.     s7.insert(new Integer(3));
    
44.     s7.insert(new Integer(2));
    
45.     s7.insert(new Integer(1));
    
46.     System.out.println("Set s7 = " + s7);
    
47. 
    
48.     s6.union(s7);
    
49.     System.out.println("After s6.union(s7), s6 = " + s6);
    
50. 
    
51.     s6.intersect(s4);
    
52.     System.out.println("After s6.intersect(s4), s6 = " + s6);
    
53. 
    
54.     Set s8 = new Set();
    
55.     System.out.println("Set s8 = " + s8);
    
56. 
    
57.     Set s9 = new Set();
    
58.     s9.insert(new Integer(3));
    
59.     s9.insert(new Integer(2));
    
60.     s9.insert(new Integer(1));
    
61.     System.out.println("Set s9 = " + s9);
    
62. 
    
63.     Set s10 = new Set();
    
64.     System.out.println("Set s10 = " + s10);
    
65. 
    
66.     s8.intersect(s9);
    
67.     System.out.println("After s8.intersect(s9), s8 = " + s8);
    
68. 
    
69.     s10.intersect(s8);
    
70.     System.out.println("After s10.intersect(s8), s10 = " + s10);
    
71. 
    
72.     s10.intersect(s9);
    
73.     System.out.println("After s10.intersect(s9), s10 = " + s10);
    
74. 
    
75.     Set s11 = new Set();
    
76.     s11.insert(new Integer(4));
    
77.     s11.insert(new Integer(8));
    
78.     s11.insert(new Integer(5));
    
79.     System.out.println("Set s11 = " + s11);
    
80.     Set s14 = s11;
    
81. 
    
82.     Set s12 = new Set();
    
83.     s12.insert(new Integer(1));
    
84.     s12.insert(new Integer(3));
    
85.     s12.insert(new Integer(5));
    
86.     s12.insert(new Integer(7));
    
87.     s12.insert(new Integer(9));
    
88.     System.out.println("Set s12 = " + s12);
    
89.     Set s13 = s12;
    
90. 
    
91.     s11.intersect(s12);
    
92.     System.out.println("After s11.intersect(s12), s11 = " + s11);
    
93. 
    
94.     System.out.println("Set s13 = " + s13);
    
95. 
    
96.     System.out.println("Set s14 = " + s14);
    
97. 
    
98.     s13.intersect(s12);
    
99.     System.out.println("After s13.intersect(s12), s13 = " + s13);
    
100. 
     
101.     s13.intersect(s14);
     
102.     System.out.println("After s13.intersect(s14), s13 = " + s13);
     
103. 
     
104. 
     
105.     System.out.println("s13.cardinality() = " + s13.cardinality());

复制代码

简直要调哭了 终于调出来 不过一直报一个warning说Type safety: The method compareTo(Object) belongs to the raw type Comparable. References to generic type Comparable<T> should be parameterized 这个需不需要管啊？

Hw5, match时间复杂度有意思！