/*
 * @lc app=leetcode.cn id=1 lang=java
 *
 * [1] 两数之和
 */
class Solution {
    public int[] twoSum(int[] nums, int target) {
        
        int[] in = new int[2];

        for (int i = 0; i < nums.length; i++) {
            for (int j = 0; j < nums.length; j++) {
                if(i!=j && (nums[i]+nums[j])==target){
                    in[0] = i;
                    in[1] = j;
                }
            }
        }

        return in;
    }
}