Berkeley CS 61B Data Structures(in Java) Lab3 讨论帖

继续跟进！

有点偷懒不想做，不过练练还是有好处，来交lab了~

大家写test都好用心 我偷懒了

lab要比homework省力好多啊

一开始出了点小问题。。。

虽然不加分但是也交下作业吧。。。
希望一周内能刷到lab7 + hw 5 + proj 1，
下次好好跟普林斯顿的算法。。

mark~~~~~~~~~

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 insertEnd(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 insertEnd(4): [  1  2  3  4  ]

Here is a list after insertEnd 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  ]

original line is:  [  6  9  12  ]

new line is:  [  3  6  9  12  15  ]

这次的Lab比较简单，用Tail就可以解决

whdawn 发表于 2015-4-8 17:37
这次的Lab比较简单，用Tail就可以解决

男神好屌！