Skip to content

[pull] master from youngyangyang04:master #360

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Oct 8, 2023
Merged

[pull] master from youngyangyang04:master #360

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
e68557e
修正0001.两数之和dart
w830207 Oct 3, 2023
2d57993
Merge pull request #2291 from w830207/master
youngyangyang04 Oct 8, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
修正0001.两数之和dart 
- 儘量給定類型
- 使用HashMap取代不適合的List
  • Loading branch information
@w830207
w830207 committed Oct 3, 2023
commit e68557e03a312f6aa99c49a7fe7701b8befaa30c
20 changes: 11 additions & 9 deletions problems/0001.两数之和.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -402,16 +402,18 @@ public class Solution {
### Dart:

```dart
List<int> twoSum(List<int> nums, int target) {
var tmp = [];
for (var i = 0; i < nums.length; i++) {
var rest = target - nums[i];
if(tmp.contains(rest)){
return [tmp.indexOf(rest), i];
}
tmp.add(nums[i]);
import 'dart:collection';

List<int> twoSum(List<int> nums, int target) {
HashMap<int, int> hashMap = HashMap();
for (int i = 0; i < nums.length; i++) {
int rest = target - nums[i];
if (hashMap.containsKey(rest)) {
return [hashMap[rest]!, i];
}
return [0 , 0];
hashMap.addEntries({nums[i]: i}.entries);
}
return [];
}
```

Expand Down