ehlxr/hello-algo
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add a chapter of binary tree.

Browse Source
This commit is contained in:
krahets
2022-11-12 22:48:46 +08:00
parent ac8d0bcfeb
commit 7fdb4d1443
11 changed files with 150 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
codes/java/chapter_computational_complexity/space_time_tradeoff/leetcode_two_sum.java → codes/java/chapter_computational_complexity/leetcode_two_sum.java
View File

@@ -1,4 +1,4 @@
package chapter_computational_complexity.space_time_tradeoff;
package chapter_computational_complexity;
import java.util.*;
@@ -36,10 +36,11 @@ public class leetcode_two_sum {
int target = 9;
// ====== Driver Code ======
// 方法一
solution_brute_force slt1 = new solution_brute_force();
int[] res = slt1.twoSum(nums, target);
System.out.println(Arrays.toString(res));
// 方法二
solution_hash_map slt2 = new solution_hash_map();
res = slt2.twoSum(nums, target);
System.out.println(Arrays.toString(res));

2
codes/java/chapter_computational_complexity/space_complexity/space_complexity_types.java → codes/java/chapter_computational_complexity/space_complexity_types.java
View File

@@ -1,4 +1,4 @@
package chapter_computational_complexity.space_complexity;
package chapter_computational_complexity;
import include.*;
import java.util.*;

2
codes/java/chapter_computational_complexity/time_complexity/time_complexity_types.java → codes/java/chapter_computational_complexity/time_complexity_types.java
View File

@@ -1,4 +1,4 @@
package chapter_computational_complexity.time_complexity;
package chapter_computational_complexity;
public class time_complexity_types {
/* 常数阶 */

2
codes/java/chapter_computational_complexity/time_complexity/worst_best_time_complexity.java → codes/java/chapter_computational_complexity/worst_best_time_complexity.java
View File

@@ -1,4 +1,4 @@
package chapter_computational_complexity.time_complexity;
package chapter_computational_complexity;
import java.util.*;