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

写完了~感觉不难~啦啦啦

还需要熟练，争取以后做到一次写对，画图有助于理解。不要漏掉语句

终于搞定了。。。。。

写完啦，懒得贴图了，还是蛮简单的

哦也~

这次lab只要逻辑清晰就十分简单。。。继续加油！

不难    不知道链表在日常的应用多么? 和Array比优劣如何?

花了俩小时，总算弄明白了。嗨森～

久违地来打个卡~

Lab4DList1

### TESTING insertFront ###

Empty list is [  ]

Inserting 9 at front.

List with 9 is [  9  ]

Inserting 8 at front.

List with 8 and 9 is [  8  9  ]

### TESTING removeFront ###

List with 1 and 2 is [  1  2  ]

Removing front node.

List with 2 is [  2  ]

Removing front node.

Empty list is [  ]

Removing front node.

Empty list is [  ]

DList2

### TESTING insertFront ###

Empty list is [  ]

Inserting 9 at front.

List with 9 is [  9  ]

Inserting 8 at front.

List with 8 and 9 is [  8  9  ]

### TESTING removeFront ###

List with 1 and 2 is [  1  2  ]

List with 2 is [  2  ]

Empty list is [  ]

Empty list is [  ]