欢迎使用优快云-markdown编辑器

最新推荐文章于 2021-01-07 23:01:28 发布

原创最新推荐文章于 2021-01-07 23:01:28 发布 · 155 阅读

0 ·

CC 4.0 BY-SA版权

习题专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一个经典的编程问题——TwoSum问题的解决方案。通过使用双层循环的方式，找到数组中两个数相加等于特定目标值的下标。该方法简单易懂，适合编程初学者学习。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Subscribe to see which companies asked this question.

解题思路：采用两层循环，在时间复杂度为O（n^2）,空间复杂度为O（1）的情况下即可实现。

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