Leetcode问题-1（Two Sum）_in function ‘twosum’-CSDN博客

本文链接：https://blog.csdn.net/figo_cui/article/details/47701039

Leetcode问题-1（Two Sum）

问题描述

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

分析
1. index1小于index2
2. 测试用例都有解
3. index的不是从0开始的，是从一开始的，例如{2, 7, 11, 15}的index是1,2,3,4，所以结果是2,7的index，即1,2
4. 需要注意有负数的情况
5. 需要注意有[0,3,4,0]的情况，即有重复元素的情况

代码：

typedef struct _node
{
    int fposition;
    int sposition;
    char exit;
}node;

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target)
    {
        vector<int> result;

        // 如果nums有元素为负数，那么不能使用items[x]来记录其位置
        // 因此先转换为全部非负数
        int min = target;
        for (int m = 0; m < nums.size(); ++m)
        {
            min = nums[m] < min ? nums[m] : min;
        }
        if (min < 0)
        {
            for (int m = 0; m < nums.size(); ++m)
            {
                nums[m] += -min;
            }
            target += -min;
            target += -min;
        }

        // items数组用于记录元素出现的位置及次数
        vector<node> items(target + 1, {0, 0, 0});
        for (int m = 0; m < nums.size(); ++m)
        {
            int num = nums[m];
            // 如果num比target大，舍弃元素，因为最小值是0，任意元素
            // 与其之和肯定是大于target的
            if (num > target)
            {
                continue;
            }
            else
            {
                if (items[num].fposition == 0)
                    items[num].fposition = m;
                else if(items[num].sposition == 0)
                    // 此处说明有两个元素为num
                    items[num].sposition = m;
                items[num].exit += 1;
            }
        }
        int fposition, sposition;
        for (int num = 0; num <= items.size() / 2; ++num)
        {
            if (num != target - num && items[num].exit == 1 && items[target-num].exit == 1)
            {
                fposition = items[num].fposition + 1;
                sposition = items[target-num].fposition + 1;
                result.push_back(fposition <= sposition ? fposition : sposition);
                result.push_back(fposition > sposition ? fposition : sposition);
                break;
            }
            if (num == target - num && items[num].exit >= 2)
            {
                fposition = items[num].fposition + 1;
                sposition = items[num].sposition + 1;
                result.push_back(fposition <= sposition ? fposition : sposition);
                result.push_back(fposition > sposition ? fposition : sposition);
                break;
            }
        }
        return result;
    }
};