【c++&leetcode个人刷题】(#1 Two Sum（两数之和）)

【leetcode个人刷题】(#1 Two Sum（两数之和）)

Two Sum

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

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

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]

Example 3:
Input: nums = [3,3], target = 6
Output: [0,1]

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/two-sum

思路

对于这题，我的第一思路就是穷举法，竟然是刷题，主要是锻炼思路，那么那么先不管三七二十一先试试看。
由于同一个值不能重复使用，那么我们就把循环做成：

for(i=0;i<num-1;i++){
    for(j=i+1;j<num;j++)
    {...}
	...
}

最后结果就为：

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

如有错误，欢迎指正