zoukankan      html  css  js  c++  java
  • 1_Two Sum

    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].

    记录第一个LeetCode题, c++的STL库不会用, (╥╯^╰╥)

    class Solution {
    public:
        vector<int> twoSum(vector<int>& nums, int target) {
            vector<int> ret;
            
            for (int i = 0; i < nums.size() - 1; i++) {
                for (int j = i + 1; j < nums.size(); j++) {
                    if(target == (nums[i] + nums[j])){
                        ret.push_back(i);
                        ret.push_back(j);
                        return ret;
                    }
                }
            }
            return ret;
        }
    };
    
  • 相关阅读:
    操作集锦
    大吉大利(算贡献)
    96. 奇怪的汉诺塔
    P760通天之汉诺塔
    First Last Sorting
    9.12小结
    day_06
    day_05作业
    day_05
    day_04
  • 原文地址:https://www.cnblogs.com/hesper/p/10386052.html
Copyright © 2011-2022 走看看