mirror of
https://github.com/krahets/hello-algo.git
synced 2025-11-02 04:31:55 +08:00
Add a chapter of binary tree.
This commit is contained in:
@ -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));
|
||||
@ -1,4 +1,4 @@
|
||||
package chapter_computational_complexity.space_complexity;
|
||||
package chapter_computational_complexity;
|
||||
|
||||
import include.*;
|
||||
import java.util.*;
|
||||
@ -1,4 +1,4 @@
|
||||
package chapter_computational_complexity.time_complexity;
|
||||
package chapter_computational_complexity;
|
||||
|
||||
public class time_complexity_types {
|
||||
/* 常数阶 */
|
||||
@ -1,4 +1,4 @@
|
||||
package chapter_computational_complexity.time_complexity;
|
||||
package chapter_computational_complexity;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
Reference in New Issue
Block a user