zoukankan      html  css  js  c++  java
  • [leetcode] 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].

    思路:

    暂无

    c++代码实现:

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

      

  • 相关阅读:
    go语言的垮平台编译
    vscode使用技巧
    集合
    泛型
    异常
    Java垃圾回收机制
    java学习笔记9.20
    java变量类型
    目前的学习计划
    离第一篇博客三天
  • 原文地址:https://www.cnblogs.com/guweixin/p/10414035.html
Copyright © 2011-2022 走看看