1- #Frameworks: are used in paradigms and patterns
1+ #Frameworks: are used in paradigms and patterns
22## method:
331 . clarification: constraints
442 . ideas: ( 1. brute force algorithm 2. ...)
1616 3 . load test
1717
1818
19- ##Array traversal framework, typical linear iterative structure:
19+ ##Array traversal framework, typical linear iterative structure:
2020```
2121void traverse(int[] arr) {
2222 for (int i = 0; i < arr.length; i++) {
2323 // iteratively visit arr[i]
2424 }
2525}
2626```
27- ##Linked list traversal framework has both iterative and recursive structure:
27+ ##Linked list traversal framework has both iterative and recursive structure:
2828```
2929/* Basic node of the single linked list */
3030class Link {
@@ -46,7 +46,7 @@ void traverse(Link head) {
4646}
4747```
4848Remember using previous, current, next pointers when is needed
49- ##Binary tree traversal framework, typical nonlinear recursive traversal structure:
49+ ##Binary tree traversal framework, typical nonlinear recursive traversal structure:
5050```
5151/* Basic node of the binary tree */
5252class TreeNode {
@@ -64,7 +64,7 @@ void DFSTraverse(Node root) {
6464}
6565```
6666
67- ##the framework for almost all BT resolve
67+ ##the framework for almost all BT resolve
68681 . base case
69692 . recursive on left;
70703 . recursive on right;
@@ -94,7 +94,7 @@ void BFSTraverse(Node root) {
9494}
9595```
9696
97- ##There is a template for backtracking algorithms:
97+ ##There is a template for backtracking algorithms:
9898```
9999result = []
100100def backtrack(Path, selection List):
@@ -109,9 +109,9 @@ def backtrack(Path, selection List):
109109```
110110
111111
112- ##template for Sliding Window Algorithm pattern:
113- ###[ window)
114- ####Static
112+ ##template for Sliding Window Algorithm pattern:
113+ ###[ window)
114+ ####Static
115115```
116116int left = 0, right = k;
117117for (int i = 0; i < k; i++)
@@ -124,7 +124,7 @@ while (right < s.size()) {
124124 left++;
125125}
126126```
127- ####Dynamic
127+ ####Dynamic
128128```
129129int left = 0, right = 0;
130130
@@ -139,7 +139,7 @@ while (right < s.size()) {
139139}
140140```
141141
142- ##template for recurtion by sample:
142+ ##template for recurtion by sample:
143143How many hairs does Monkey King have? Answer: One plus the rest.
144144
145145How old are you this year? Answer: One year plus my age of last year, I was born in 1999.
@@ -150,4 +150,4 @@ int func(How old are you this year) {
150150 // self-calling to decompose problem
151151 return func(How old are you last year) + 1;
152152}
153- ```
153+ ```
0 commit comments