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：爆破法，一个一个往过算呗，类似于冒泡排序

class Solution {
         public int[] twoSum(int[] nums, int target) {
            int size = nums.length;
            int[] nums_cache = new int[2];
            for(int i = 0;i < size - 1;i++){
                for(int j = i+1;j <= size - 1;j++){
                    if(nums[i] + nums[j] == target){
                        nums_cache[0] = i;
                        nums_cache[1] = j;
                        return nums_cache;
                    }
                }
            }
            return null;
        }
}

解法2：让我再想想,再想想…..