Berkeley CS 61B Data Structures(in Java) 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.



Set s = [  3  4  ]
Set s2 = [  4  5  ]
Set s3 = [  3  5  8  ]
After s.union(s2), s = [  3  4  5  ]
After s.intersect(s3), s = [  3  5  ]
s.cardinality() = 2
感觉算法做复杂了。。。

感觉partII最好还是自己加几个test

smallmikko 发表于 2015-6-21 08:47
请问您后来是怎么把DList l这个值赋到每个node.myList上的？大概的思路什么样，因为不管是哪种insert，ar ...

不好意思刚看到。。貌似是直接强制转换吧。记得不是很清楚了

小A要当码农 发表于 2015-6-18 22:28
求问大神 能解释得再详细一些么？
谢谢！

本学弱猜想是建立一个新的list 对象，利用多态性，去调用list子类的override过的一些函数

写了好久。。。一张图放不下分了2张，求加分

Homework 5Part 1

Part 2

part 2的intersect()要考虑多种边界条件。比如空集的情况；s1.intersect(s2)时，s2触发了exception，s1能不能继续把剩下的元素删掉。
下面是我的test cases，抛砖引玉。

1.   public static void main(String[] argv) {
   
2.     System.out.println("Testing insert()");
   
3.     Set s = new Set();
   
4.     s.insert(new Integer(3));
   
5.     s.insert(new Integer(4));
   
6.     s.insert(new Integer(3));
   
7.     System.out.println("Set s should be { 3 4 }: " + s);
   
8. 
   
9.     Set s2 = new Set();
   
10.     s2.insert(new Integer(4));
    
11.     s2.insert(new Integer(5));
    
12.     s2.insert(new Integer(5));
    
13.     System.out.println("Set s2 should be { 4 5 }: " + s2);
    
14. 
    
15.     Set s3 = new Set();
    
16.     s3.insert(new Integer(5));
    
17.     s3.insert(new Integer(3));
    
18.     s3.insert(new Integer(8));
    
19.     System.out.println("Set s3 should be { 3 5 8 }: " + s3);
    
20. 
    
21.     System.out.println();
    
22.     System.out.println("Tesing union()");
    
23.     s.union(s2);
    
24.     System.out.println("After s.union(s2), s should be { 3 4 5 }: " + s);
    
25.     s2.union(s3);
    
26.     System.out.println("After s2.union(s3), s2 should be { 3 4 5 8 }: " + s2);
    
27.     Set s4 = new Set();
    
28.     System.out.println("Empty set s4 = " + s4);
    
29.     s.union(s4);
    
30.     System.out.println("After s.union(s4), s should be { 3 4 5 }: " + s);
    
31.     s4.union(s);
    
32.     System.out.println("After s4.union(s), s4 should be { 3 4 5 }: " + s4);
    
33. 
    
34.     System.out.println();
    
35.     System.out.println("Tesing intersect()");
    
36.     Set s5 = new Set();
    
37.     Set s6 = new Set();
    
38.     s6.insert(new Integer(1));
    
39.     s5.intersect(s6);
    
40.     System.out.println("{}.intersect({1}) should be { }: " + s5);
    
41.     s6.intersect(s5);
    
42.     System.out.println("{1}.intersect({}) should be { }: " + s6);
    
43.     s6.insert(new Integer(1));
    
44.     Set s7 = new Set();
    
45.     s7.insert(new Integer(1));
    
46.     s7.insert(new Integer(2));
    
47.     s6.intersect(s7);
    
48.     System.out.println("{1}.intersect({1 2}) should be { 1 }: " + s6);
    
49.     s6.insert(new Integer(2));
    
50.     s6.insert(new Integer(3));
    
51.     s6.intersect(s7);
    
52.     System.out.println("{1 2 3}.intersect({1 2}) should be { 1 2 }: " + s6);
    
53.     s6.insert(new Integer(3));
    
54.     s6.insert(new Integer(5));
    
55.     s7.insert(new Integer(4));
    
56.     s7.insert(new Integer(7));
    
57.     s7.intersect(s6);
    
58.     System.out.println("{1 2 4 7}.intersect({1 2 3 5}) should be { 1 2 }: " + s7);
    
59. 
    
60.     System.out.println();
    
61.     System.out.println("Tesing cardinality()");
    
62.     System.out.println("s.cardinality() should be 3: " + s.cardinality());
    
63.     System.out.println("s4.cardinality() should be 3: " + s4.cardinality());
    
64.     System.out.println("s5.cardinality() should be 0: " + s5.cardinality());
    
65.     System.out.println("s6.cardinality() should be 4: " + s6.cardinality());
    
66.     System.out.println("s7.cardinality() should be 2: " + s7.cardinality());
    
67.   }

复制代码

上传作业，本次作业要多谢Enirinth大神提供的算法思路，一开始自己用的方法太烦了。因为上传限制就只上传part2的部分吧。。

Homework 5:

请问Set.java应该放在哪里啊？我用的Eclipse，感觉应该放在list 这个package之外，我又新建了个project，然后在里面创建Set.java，但是就报错啊。。。谢谢了，cs基础薄弱

补交一下hw5^ ^