質問する

👉 1. 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.
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

解答方法

2つの数がターゲットと一致するかどうかを1つずつ順番に計算します.
まず数(now)を選択し、(target-now)の値が配列に存在する場合はベクトルに追加します.

コード#コード#

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