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

不给加米也要继续

有点意思

不知道为什么传不了图片..只好直接粘贴了,其实做出来结果是一样的..
Lab总是比Homework简单，接下来终于要到project啦~~~
DList1:
### 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 [  ]

这次作业隔得时间有点长了，后面的作业得要加快赶上了，keep running.

看了别人的讲解才知道有sentinal的Dlist不需要考虑只有一个node的情况， 然后在做Dlist1的时候又没考虑到只有一个节点的情况，导致各种空指针错误。

没看清题目要求，浪费时间。。

看走眼-0-跳过了Lab 3，先交了4再去做3

交作业！！

终于会了！

交作业，字数字数。