class Solution {
public int[] twoSum(int[] nums, int target) {
int[] ss= new int [2];
for(int i = 0 ; i < nums.length ; i++ ){
for(int j = i + 1 ; j < nums.length ; j++ ){
if(target == (nums[i] + nums[j])){
ss[0] = i;
ss[1] = j;
}
}
}
return ss;
}
}
2数之和
最新推荐文章于 2023-06-27 22:30:33 发布