algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2291 from w830207/master

Browse Source 
修正0001.两数之和dart
This commit is contained in:
程序员Carl
2023-10-08 09:52:12 +08:00
committed by GitHub
parent 08e03bf1a9 e68557e03a
commit 2d57993364
1 changed files with 11 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
problems/0001.两数之和.md
View File

@ -402,16 +402,18 @@ public class Solution {
### Dart: ### Dart:
```dart ```dart
List<int> twoSum(List<int> nums, int target) { import 'dart:collection';
var tmp = [];
for (var i = 0; i < nums.length; i++) { List<int> twoSum(List<int> nums, int target) {
var rest = target - nums[i]; HashMap<int, int> hashMap = HashMap();
if(tmp.contains(rest)){ for (int i = 0; i < nums.length; i++) {
return [tmp.indexOf(rest), i]; int rest = target - nums[i];
} if (hashMap.containsKey(rest)) {
tmp.add(nums[i]); return [hashMap[rest]!, i];
} }
return [0 , 0]; hashMap.addEntries({nums[i]: i}.entries);
}
return [];
} }
``` ```