leetcode TwoSum

解法一：双重循环， 复杂度O(n^2)

public class Solution {public static void main(String[] args){int c[] = {3,3,6};Solution So = new Solution();int[] result=So.twoSum(c,9);System.out.println(result[0]);System.out.println(result[1]);}    public int[] twoSum(int[] nums, int target) {    int[] numstar=new int[2];    boolean flag=false;        for(int i=0;i<nums.length;i++){        if(!flag){        for(int j=i+1;j<nums.length;j++){            if(nums[i]+nums[j]==target){            numstar[0]=i;            numstar[1]=j;            flag=true;            }            }        }                        }        return numstar;    }}