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

传不了图片
1.

Now we are testing DList.

Here is a list after insertBack 6, 9, 12: [  6  9  12  ]

Here is the same list after insertBack(15) and insertFront(3): [  3  6  9  12  15  ]

front() should be 3. It is: 3

front's next should be 6. It is: 6

front's next's prev should be 3. It is: 3

After remove the front, the front() should be 6. It is: 6

After insertBefore() and insertAfter(), The first 3 nodes should be 5,6,8. The list is: [  5  6  8  9  12  15  ]

Here is a list after construction: [  ]

isEmpty() should be true. It is: true

length() should be 0. It is: 0

Here is a list after insertFront(3) to an empty list: [  3  ]

Here is a list after insertBack(5) on an empty list: [  5  ]

Here is a list after insertFront 3, 2, 1: [  1  2  3  ]

isEmpty() should be false. It is: false

length() should be 3. It is: 3

Here is the same list after insertBack(4): [  1  2  3  4  ]

Here is a list after insertBack 6, 7: [  6  7  ]

isEmpty() should be false. It is: false

length() should be 2. It is: 2

Here is the same list after insertFront(5): [  5  6  7  ]

2.

Now we are testing LockDList.

Here is a list after insertBack 6, 9, 12: [  6  9  12  ]

Here is the same list after insertBack(15) and insertFront(3): [  3  6  9  12  15  ]

front() should be 3. It is: 3

front's next should be 6. It is: 6

front's next's prev should be 3. It is: 3

We lockNode front()= 3

After remove the locked front, the front() should still be 3. It is: 3

After remove the back, the back() should be 12. It is: 12

After insertBefore(3) and insertAfter(3), The first 3 nodes should be 5,3,8. The list is: [  5  3  8  6  9  12  ]

Here is a list after construction: [  ]

isEmpty() should be true. It is: true

length() should be 0. It is: 0

Here is a list after insertFront(3) to an empty list: [  3  ]

Here is a list after insertBack(5) on an empty list: [  5  ]

Here is a list after insertFront 3, 2, 1: [  1  2  3  ]

isEmpty() should be false. It is: false

length() should be 3. It is: 3

Here is the same list after insertBack(4): [  1  2  3  4  ]

Here is a list after insertBack 6, 7: [  6  7  ]

isEmpty() should be false. It is: false

length() should be 2. It is: 2

Here is the same list after insertFront(5): [  5  6  7  ]

感谢大神提供的tester

打卡交作业，感谢楼主提供的test资源

请教下part2 要怎么call才能violate invariant啊？感觉怎么都不行啊－ －

感谢提供的测试代码。看了首页的前辈解答增长了很多知识，谢谢了。

好几天没好好学习了！！！到Exception那块就听不进去。。但是2016年的最后一天还是要装模作样的学学习来圆满结束这一年，谢谢楼主提供的test code！
出国后尽管学习很紧张，大多都是独自一个人，但真真正正让我开始思考人生，开始用更乐观、更包容的心态面对一切。
总之，新的一年，好好锻炼，好好吃饭，努力进步。希望可以看更美的风景，遇到更有趣的人，成为更好的自己。
新年快乐～～

就上传有Lock的图吧，十分感谢第一条回复，看完了对多态的理解好了很多

做完对继承理解了一些。

我也是一开始轻视这次的作业了，一直做到partIII， 才发现原来要把继承搞清楚才可以。
这次作业用时比预料的长，特别是子类的field需不需要重写覆盖掉父类的，需要好好的理解。
结果发现我男神已经为我们想好了最佳方案了，只要重写一个小小的方法就可以了。从心里又膜拜了一把。

我用了自己写的测试数据