算法第一周Tow Sum[easy]

最新推荐文章于 2024-07-25 19:52:29 发布

south_l

最新推荐文章于 2024-07-25 19:52:29 发布

阅读量237

点赞数

分类专栏：算法文章标签： leetcode 算法

本文链接：https://blog.csdn.net/south_l/article/details/78011138

版权

算法专栏收录该内容

41 篇文章 0 订阅

订阅专栏

1.Tow Sum [easy]

Description

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

Solution

此题是在给定数组中找到两个数使其和为target，返回这个数的坐标；
这个题目主要有两个注意的点：

数组中的数不能重复使用
题目中假定只含有一组解，那我们只需返回拿到的第一满足题目要求的即可

本题采用C语言。

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* nums, int numsSize, int target) {
    int* result = (int)malloc(2);
    int flag = 0;
    for (int i = 0; i < numsSize; i++) {
        for (int j = i+1; j < numsSize; j++) {
            if (nums[i]+nums[j] == target) {
                result[0] = i;
                result[1] = j;
                flag = 1;
                break;
            }
        }
        if (flag == 1) break;
    }
    return result;
}