package leetcode;
public class day1 {
public static void main(String[] args) {
Solution s1=new Solution();
//int target=6;
s1.target=6;
s1.nums=new int[]{3,2,4,2,4};
System.out.println("["+s1.twoSum(s1.nums, s1.target)[0]+","+s1.twoSum(s1.nums, s1.target)[1]+"]");
}
}
class Solution{
int target;
int[] nums;
public int[] twoSum(int[] nums,int target){
int[] ans=new int[2];
mall:for(int i=0;i<nums.length;i++){
for(int j=i+1;j<nums.length;j++){
if(nums[i]+nums[j]==target){
System.out.println(nums[i]+"+"+nums[j]+"="+target);
System.out.println(i+"+"+j);
ans[0]=i;
ans[1]=j;
break mall;
}
}
}
return ans;
}
}