mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-25 01:46:29 +08:00
Add a test and update ts code style
This commit is contained in:
parent
3265e3fde0
commit
4a31f909c6
2 changed files with 19 additions and 10 deletions
|
@ -30,4 +30,13 @@ function twoSumHashTable(nums: number[], target: number): number[] {
|
|||
}
|
||||
}
|
||||
return [];
|
||||
};
|
||||
};
|
||||
|
||||
/* Driver Code */
|
||||
let nums = [2, 7, 11, 15]
|
||||
twoSumBruteForce(nums, 9)
|
||||
console.log("使用暴力枚举后得到结果:", nums)
|
||||
|
||||
let nums1 = [2, 7, 11, 15]
|
||||
twoSumHashTable(nums1, 9)
|
||||
console.log("使用辅助哈希表后得到结果", nums1)
|
|
@ -97,16 +97,16 @@ comments: true
|
|||
|
||||
```typescript title="leetcode_two_sum.ts"
|
||||
function twoSumBruteForce(nums: number[], target: number): number[] {
|
||||
let n = nums.length;
|
||||
// 两层循环,时间复杂度 O(n^2)
|
||||
for (let i = 0; i < n; i++) {
|
||||
for (let j = i + 1; j < n; j++) {
|
||||
if (nums[i] + nums[j] === target) {
|
||||
return [i, j]
|
||||
}
|
||||
let n = nums.length;
|
||||
// 两层循环,时间复杂度 O(n^2)
|
||||
for (let i = 0; i < n; i++) {
|
||||
for (let j = i + 1; j < n; j++) {
|
||||
if (nums[i] + nums[j] === target) {
|
||||
return [i, j];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return [];
|
||||
return [];
|
||||
};
|
||||
```
|
||||
|
||||
|
|
Loading…
Reference in a new issue