ARTS-No.1
Algorithm
Two Sum
解法一: 暴力循环
1
2
3
4
5
6
7
8
9
10
11
12
13class Solution {
public int[] twoSum(int[] nums, int target) {
for (int i = 0; i < nums.length - 1; i++) {
int temp = target - nums[i];
for (int j = i + 1; j < nums.length; j++) {
if (nums[j] == temp) {
return new int[]{i, j};
}
}
}
return null;
}
}执行耗时: 17ms, 内存消耗: 37.4MB