cs61b代码点

- [ ] 链表
    - [ ] 裸链表
    - [ ] 迭代的基本实现
    - [ ] Java工具链表
    - [ ] 习题
    	- [ ]2.1guide 
    		-Rewrite the size, iterativeSize, and get methods from lecture by using this the starter code for the IntList class.
    		-Write methods incrList and dincrList as described in Lists1Exercises. If your solution uses size, iterativeSize, or get, you’ll need to complete the previous exercise first. 
    	- [ ]2.2guide
    		- Do problem 5 from midterm 1 in Kartik’s textbook
    		- Modify the Intlist class so that every time you add a value you “square” the IntList.For example, upon the insertion of 5, the below IntList would transform from:1 => 2 to 1 => 1 => 2 => 4 => 5 and if 7 was added to the latter IntList, it would become 1 => 1 => 1 => 1 => 2 => 4 => 4 => 16 => 5 => 25 => 7 Additionally, you are provided the constraint that you can only access the size() function one time during the entire process of adding a node.
    	-[ ]week3 disc1
    		-Helping Hand Extra
    	-[ ]week3 disc2!
    - [ ] 双向链表
- [ ] 数组
    - [ ] 基本实现
    - [ ] 习题
    	- [ ] 2.3guide
    		- 完成 Kartik教科书练习中期 1 中的第 10 题
    		- 完成 2015 年春季中期 1 中的第 7 题
    - [ ] 循环数组
- [ ] Arrayset
    - [ ] 基本实现
    - [ ] 带迭代器的基本实现