1.两数之和
class Solution { public int[] twoSum(int[] nums, int target) { int[] num = new int[2]; for (int i = 0; i < nums.length; i++) { for (int j = 0; j < nums.length; j++) { if (target == nums[i] + nums[j]) { if (i != j) { num = new int[]{i, j}; return num; } else if(i==j) break; } else { continue; } } } return num; } }

浙公网安备 33010602011771号