algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 04:31:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update worst_best_time_complexity,

Browse Source 
leetcode_two_sum
This commit is contained in:
Yudong Jin
2023-02-03 18:53:15 +08:00
parent 592965595e
commit 70dead5cd0
24 changed files with 63 additions and 121 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/java/chapter_computational_complexity/leetcode_two_sum.java
View File

@ -8,6 +8,7 @@ package chapter_computational_complexity;
import java.util.*;
/* 方法一：暴力枚举 */
class SolutionBruteForce {
public int[] twoSum(int[] nums, int target) {
int size = nums.length;
@ -22,6 +23,7 @@ class SolutionBruteForce {
}
}
/* 方法二：辅助哈希表 */
class SolutionHashMap {
public int[] twoSum(int[] nums, int target) {
int size = nums.length;

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

@ -29,6 +29,8 @@ public class worst_best_time_complexity {
/* 查找数组 nums 中数字 1 所在索引 */
static int findOne(int[] nums) {
for (int i = 0; i < nums.length; i++) {
// 当元素 1 在数组头部时，达到最佳时间复杂度 O(1)
// 当元素 1 在数组尾部时，达到最差时间复杂度 O(n)
if (nums[i] == 1)
return i;
}