专注下来，好好刷题

9/2/2018

CS 61B

8. GRoE,implementation Inheritance,Overriding,dynamic(instantiation,run time)method selection,static(declaration,compile time),overloading and overiding, puzzle; Is a, Has a  
                                                                                                                                                                                                                                                                                                                                                                                                9. Extends, extends with overriden Constructors Are Not Inherited:While constructors are not inherited, Java requires that all constructors must start with a call to one of its superclass's constructors, The Object Class, Is-a vs. Has-a, Encapsulation, Abstraction Barriers, Type Checking and Casting：the compiler determines whether or not something is valid based on the static type of the object, Expressions, Higher Order Functions;

补充内容 (2018-9-4 09:20):
LC:

581. Shortest Unsorted Continuous Subarray;

724. Find Pivot Index

补充内容 (2018-9-4 09:20):
LC:

581. Shortest Unsorted Continuous Subarray;

724. Find Pivot Index

TJ407 发表于 2018-9-3 09:42
顶，加油，祝你好运！

多谢多谢，你也好运！！

9／4／2018

CS 61B

14. Exceptions( throw exceptions using throw key word; checked and unchecked; try catch), Iterators, Iterables;

Write papers

9/10/2018

CS 61B  (160 min)

15. Packages, Access Control, Objects;

16. Encapsulation, Lists, Delegation vs. Extension ;

17. Asymptotics I
Programming Cost:everything in the course up to this date , Execution Cost:  everything in the course from this point on
1. time java simulation: depends on the machine & may take a very long time to finish;
2. operation count: machine independent, tricky to compute;
3. simplified analysis:
Intuitive Simplification 1: Consider only the Worst Case
Intuitive Simplification 2: Restrict Attention to One Operation,
Intuitive Simplification 3: Eliminate Low Order Terms
Intuitive Simplification 4: Eliminate Multiplicative Constants

18. Asymptotics II
geometric loop等比数列: there's no magic shortcut, be cautious for time complexity problems! it takes a lot of deep thought! write examples, draw pictures!
Tree Recursion;
binary search;
selection sort;
Merge Sort;

paper 105 min;

9／11／2018

1. paper

2. CS 61B

19. Asymptotics III(Merge sort: NlogN similiar to N, much better than N2；Big O is an upper bound ("less than or equals")
Big Omega is a lower bound ("greater than or equals")
Big Theta is both an upper and lower bound ("equals")
Big O does NOT mean "worst case". We can still describe worst cases using Big Theta
Big Omega does NOT mean "best case". We can still describe best cases using Big Theta
Big O is sometimes colloquially used in cases where Big Theta would provide a more precise statement
Amortized analysis provides a way to prove the average cost of operations)  

3. LC 501

9／12／2018

LC3

671 Second Minimum Node In a Binary Tree
501 Find Mode in Binary Search Tree
429 N-ary Tree Level Order Traversal

Sep. 13
LC 3       
589 N-ary Tree Preorder Traversal        
(Level order 429; pre order 589; post order 590)


Sep. 14
LC 3       
700 Search in a Binary Search Tree
590 N-ary Tree Postorder Traversal
543 Diameter of Binary Tree

Sep. 15
LC 3
617 Merge Two Binary Trees
101 Symmetric Tree
257 Binary Tree Paths

Sep. 16
LC 2
104 Maximum Depth of Binary Tree
226 Invert Binary Tree

Sep. 17
LC 3
669 Trim a Binary Search Tree
110 Balanced Binary Tree   
904 Fruit Into Baskets

坚持坚持 吼嘿！！

一起加油

mojopang 发表于 2018-9-18 13:09
一起加油

咔咔 加油加油～～