-
Notifications
You must be signed in to change notification settings - Fork 1
/
tow sum .dart
45 lines (32 loc) · 1.06 KB
/
tow sum .dart
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
// Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
// You may assume that each input would have exactly one solution, and you may not use the same element twice.
// You can return the answer in any order.
// Example 1:
// Input: nums = [2,7,11,15], target = 9
// Output: [0,1]
// Example 2 :
// Input: nums = [3,3], target = 6
// Output: [0,1]
import 'dart:io';
import 'dart:math';
void main() {
List<int> index = [];
List<int> items = [];
print("pleas enter your target");
int target = int.parse(stdin.readLineSync()!);
print("enter your length list");
int length_list = int.parse(stdin.readLineSync()!);
for (int i = 0; i < length_list; i++) {
print("pleaes enter your value of index $i");
int value = int.parse(stdin.readLineSync()!);
items.add(value);
}
for (int i = 0; i < items.length; i++) {
for (int j = 0; j < items.length; j++) {
if (items[i] + items[j] == target) {
index.addAll([i, j]);
}
}
}
print(index.toSet().toList());
}