01_两数之和

LeetCode链接：两数之和

算法思路

遍历数组，用当前元素和该元素之后元素求和，把结果和目标元素对比，记录并返回索引

代码实现

go版本

package main

import "fmt"

func twoSum(nums []int, target int) []int {
    ret := make([]int, 2, 2)
    for idx1, v1 := range nums {
        for idx2, v2 := range nums[idx1+1:] {
            if v1 + v2 == target{
                ret[0] = idx1
                ret[1] = idx1 + 1 + idx2
                break
            }
        }
    }
    return ret
}

func main() {
    nums := []int{2, 7, 11, 15}
    target := 9
    fmt.Println(twoSum(nums, target))
    nums = []int{3, 2, 4}
    target = 6
    fmt.Println(twoSum(nums, target))
}

python版本

def twoSum(nums, target):
    ret = []
    for idx1, val1 in enumerate(nums):
        for idx2, val2 in enumerate(nums[idx1+1:]):
            if val1 + val2 == target:
                ret = [idx1, idx1+1+idx2]
                break
    return ret

if __name__ == '__main__':
    nums = [2, 7, 11, 15]
    target = 9
    print(twoSum(nums, target))

Java版本

import java.util.Arrays;

public class Solution {
    public static void main(String[] args) {
        int[] nums = {2, 7, 11, 15};
        int target = 9;
        Solution solution = new Solution();
        int[] result = solution.twoSum(nums, target);
        System.out.println(Arrays.toString(result));
    }

    /*
    算法思路：
    1. 遍历数组，用每个元素和该元素之后的每个元素进行相加，用结果和target比较
    2. 如果相等，记录索引并返回
     */
    public int[] twoSum(int[] nums, int target) {
        int[] result = new int[2];
        for (int i = 0; i < nums.length; i++) {
            for (int j = i + 1; j < nums.length; j++) {
                if (nums[i] + nums[j] == target) {
                    result[0] = i;
                    result[1] = j;
                    break;
                }
            }
        }
        return result;
    }
}