mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 13:46:29 +08:00
e720aa2d24
* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
49 lines
1.2 KiB
Dart
49 lines
1.2 KiB
Dart
/**
|
|
* File: two_sum.dart
|
|
* Created Time: 2023-2-11
|
|
* Author: Jefferson (JeffersonHuang77@gmail.com)
|
|
*/
|
|
|
|
import 'dart:collection';
|
|
|
|
/* 方法一： 暴力枚举 */
|
|
List<int> twoSumBruteForce(List<int> nums, int target) {
|
|
int size = nums.length;
|
|
// 两层循环，时间复杂度为 O(n^2)
|
|
for (var i = 0; i < size - 1; i++) {
|
|
for (var j = i + 1; j < size; j++) {
|
|
if (nums[i] + nums[j] == target) return [i, j];
|
|
}
|
|
}
|
|
return [0];
|
|
}
|
|
|
|
/* 方法二： 辅助哈希表 */
|
|
List<int> twoSumHashTable(List<int> nums, int target) {
|
|
int size = nums.length;
|
|
// 辅助哈希表，空间复杂度为 O(n)
|
|
Map<int, int> dic = HashMap();
|
|
// 单层循环，时间复杂度为 O(n)
|
|
for (var i = 0; i < size; i++) {
|
|
if (dic.containsKey(target - nums[i])) {
|
|
return [dic[target - nums[i]]!, i];
|
|
}
|
|
dic.putIfAbsent(nums[i], () => i);
|
|
}
|
|
return [0];
|
|
}
|
|
|
|
/* Driver Code */
|
|
void main() {
|
|
// ======= Test Case =======
|
|
List<int> nums = [2, 7, 11, 15];
|
|
int target = 13;
|
|
|
|
// ====== Driver Code ======
|
|
// 方法一
|
|
List<int> res = twoSumBruteForce(nums, target);
|
|
print('方法一 res = $res');
|
|
// 方法二
|
|
res = twoSumHashTable(nums, target);
|
|
print('方法二 res = $res');
|
|
}
|