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

求加分~~

做了好久，有个关于强转的问题想问问大家~
(Comparable)currentNodes.item()).compareTo(currentNodethis.item()这是我写的，currentNodes.item()是Object类，强转成Comparable，运行时没有报异常是因为传入给item的是Integer的原因吗？？

感谢前辈测试代码，空集也要考虑。union intersect注意边界情况。

还是在github的帮助下完成了

这次各种小BUG 也弄了好久... 当了回伸手党， set 的test用得是前面那位大神的

（我擦，以前交过HW5的作业了，请版主忽略）这次难度明显大了，边界条件，全程烧脑

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.

来交作业~谢谢前面同志提供的test case。
Set

DList