https://leetcode.cn/problems/two-sum/
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] returnArr = new int[2];
// nums = [2,7,11,15], target = 9
for (int i = 0, len = nums.length; i < len; i++) {
for (int j = i + 1, len2 = nums.length; j < len2; j++) {
if (nums[i] + nums[j] == target) {
returnArr[0] = i;
returnArr[1] = j;
}
}
}
return returnArr;
}
}