Berkeley CS61B Spring 2019 打卡(1)

最新推荐文章于 2023-10-15 17:31:29 发布

echowo

最新推荐文章于 2023-10-15 17:31:29 发布

阅读量630

点赞数

分类专栏： Berkeley CS61B

本文链接：https://blog.csdn.net/weixin_41264869/article/details/90404016

版权

这是一篇关于Berkeley CS61B春季课程的打卡记录，涵盖了2019年5月到6月的学习内容，包括：递归、循环、数据类型、引用类型、链表、双向链表、数组、类、静态内部类、缓存、不变量、数组复制、多维数组、字符串比较、JUnit测试、动态方法选择和实现继承等概念。

摘要由CSDN通过智能技术生成

刷题记录在Dropbox Paper上

The golden rule of equals:

Types:

primitive types (9)
reference types (others)
(reference type declaration; reference type instantiation (return the address); )

IntList and Linked Data Structures
recursion / loop

Compare
Why nested class?
Nested Classes are useful when a class doesn’t stand on its own and is obviously subordinate to another class.

Why static Nested Classes?
If the nested class never uses any instance variables or methods of the outer class, declare it static.

Caching:
Caching: putting aside data to speed up retrieval.

Sentinel and Sentinel Node (“keep the same”)

Invariants:
An invariant is a condition that is guaranteed to be true during code execution

DLList
- Incorporating the Sentinel Recall that we added a sentinel node to our SLList. For DLList, we can either have two sentinels (one for the front, and one for the back), or we can use a circular sentinel.
- A DLList using a circular sentinel has one sentinel.
- The sentinel points to the first element of the list with next and the last element of the list with prev.
- In addition, the last element of the list’s next points to the sentinel and the first element of the list’s prev points to the sentinel.
- For an empty list, the sentinel points to itself in both directions.

DLList