class Solution {
public int[] twoSum(int[] nums, int target) {
int[] a = new int[2];
int i,j;
outer: for(i=0 ; i<nums.length-1 ; i++){
a[0] = i;
for(j=i+1 ; j<nums.length ; j++){
a[1] = j;
if(nums[i] + nums[j] == target)
break outer;
}
}
return a;
}
}
LeetCode1 : 两数之和
最新推荐文章于 2023-02-24 19:40:16 发布