001 两数之和

一、暴力求解

C++代码：
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> result(2, -1);
        for (int i = 0; i < nums.size(); i++) {
            for (int j = i + 1; j < nums.size(); j++) {
                if (nums[j] == target - nums[i]) {
                    return vector<int> {i, j};
                }
            }
        }
        return result;
    }
};

Java代码：
class Solution {
    public int[] twoSum(int[] nums, int target) {
        for( int i = 0; i < nums.length; i++ ){
            for( int j = i + 1; j < nums.length; j++){
                if( nums[j] == target - nums[i]){
                    return new int[] { i, j };
                }
            }
        }
        throw new IllegalArgumentException("No two sum solution");
    }
}