leetcode刷题记录

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] index=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]){
                index[0]=i;
                index[1]=j;
                return index;
                                        }
                                    }
                                }
                return index;
        }
}