質問URL: https://leetcode.cn/leetbook/read/top-interview-questions-easy/x2jrse/
public class Solution {
public int[] TwoSum(int[] nums, int target) {
int i,j;
int[] arr=new int[2]{0,0};
for(i=0;i<nums.Length;i++){
for(j=i+1;j<nums.Length;j++){
if(nums[i]+nums[j]==target){
arr[0]=i;
arr[1]=j;
break;
}
}
if(nums[i]+nums[j-1]==target)break;
}
return arr;
}
}