zoukankan      html  css  js  c++  java
  • 1. Two Sum(C++)

    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]

    答案:

    class Solution {

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



  • 相关阅读:
    毕业了!
    mesos无执行器启动docker
    docker run option
    maintenance
    virtualenv
    multi role
    排序之插入排序
    DLU-1064 美声葱
    codeforces-1025 A Doggo Recoloring
    codeforces-1027 C Minimum Value Rectangle
  • 原文地址:https://www.cnblogs.com/devin-guwz/p/6425583.html
Copyright © 2011-2022 走看看