LeetCode Two sum c++

最新推荐文章于 2022-09-16 15:56:43 发布

yu_1992_11_25

最新推荐文章于 2022-09-16 15:56:43 发布

阅读量371

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/CrazysPopcorn_qian/article/details/76517923

版权

LeetCode 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

问题：https://leetcode.com/problems/two-sum/description/

#include <iostream>
#include <vector>
#include<algorithm>
using namespace std;

/************************************************************************/
/* 
    Problem: 

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

    Author  :   crazys_popcorn@126.com
    DateTime:   2017年8月1日 11:19:38


*/
/************************************************************************/




class Solution {
public:

    vector<int> twoSum(vector<int>& nums, int target) 
    {
        int vec_size = nums.size();
        vector<int >result;
        result.clear();
        bool is_ok = false;
        int index1 = 0;
        for (int index1 = 0; index1 < nums.size(); ++index1)
        {
            int index2 = index1 + 1;
            for (; index2 < nums.size(); ++index2)
            {
                if ((nums[index2] + nums[index1] )== target)
                {
                    result.push_back(index1);
                    result.push_back(index2);
                    is_ok=true;
                    break;
                }
            }
            if (is_ok)
                break;
        }
        return result;
    }
};


void main()
{

    Solution s1;
    vector<int> arr = { 3,2,4 };
    vector<int> temp = s1.twoSum(arr, 6);

    return ;

}