leetcode-day1

1.TWO SUM
Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:
Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

1.Initial solution
class Solution {
public static int[] twoSum(int[] nums, int target) {
boolean isFind=false;
int [] result=new int[2];
while(isFind==false){
for(int i=0;i