LeetCode:Two Sum

本文介绍了一种解决两数之和问题的算法实现。给定整数数组及目标值,寻找两个数相加等于目标值的下标。通过排序与双指针技术,文章详细展示了如何高效找到符合条件的元素及其原始下标。

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

问题描述:

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

code:

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
    int index = 0;
    int index1 = 0;
    int index2 = 0;
    vector<int> nums1(nums);
    sort(nums1.begin(),nums1.end());   //升序排序
    vector<int>::size_type length = nums1.size();
    cout<<length<<endl;
    for(vector<int>::size_type ix = 0,is = --length;is != ix;)
    {
index = nums1[ix] + nums1[is];
if(index == target)
{
            index1 = ++ix;
            index2 = ++is;
<span style="white-space:pre">	</span>}
<span style="white-space:pre">	</span>else  if(index < target)
              { 
 <span style="white-space:pre">	</span>           ++ix;
 <span style="white-space:pre">	</span>      }
              else  
 <span style="white-space:pre">	</span>      { 
        <span style="white-space:pre">	</span>   --is; 
 <span style="white-space:pre">	</span>      } 
    }
   cout<<"index1 = "<<index1<<","<<"index2 = "<<index2<<endl;
   vector<int>::size_type index3 = 0;
   vector<int>::size_type index4 = 0;
   for(vector<int>::size_type ix = 0; ix != length; ++ix )
   {
       if(nums[ix] == index1)
          index3 = ++ix;
       if(nums[ix] == index2)
          index4 = ++ix;
   }
   cout<<"index3 = "<<index3<<","<<"index4 = "<<index4<<endl;
    }
};

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

fullstack_lth

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值