package leetcode;
import java.util.*;
class TwoSum_01 {
public int[] twoSum(int[] nums, int target) {
int[] answer = new int[2];
for(int i=0;i<nums.length; i++){
for(int j=0; j<nums.length; j++){
if(i == j) continue;
if(nums[i] + nums[j] == target){
answer[0] = i;
answer[1] = j;
}
}
}
Arrays.sort(answer);
return answer;
}
}
휴지통/알고리즘 & 자료구조