leetcode 01 golang实现

最新推荐文章于 2024-12-15 16:59:55 发布

原创最新推荐文章于 2024-12-15 16:59:55 发布 · 425 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #golang #go #01 #算法

leetcode 同时被 2 个专栏收录

8 篇文章

订阅专栏

golang

3 篇文章

订阅专栏

本文介绍了一种解决两数之和问题的经典算法。给定一个整数数组及目标值，算法通过双层循环遍历数组，寻找两个数相加等于目标值的组合，并返回这两个数的索引。该算法不重复使用同一元素且确保每组输入有唯一解。

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

答

func twoSum(nums []int, target int) []int {
    cnt := len(nums);

    for i := 0 ;i< cnt ;i ++{
        for j:= i + 1; j < cnt ;j++{
            if (nums[i] + nums[j]) == target{
                return []int{i,j};
            }
        }
    }

    return make([]int ,0,1);

}