解決兩數之和 (JS Java C#, Swift, Kotlin, Python,C++, Golang)

解決兩數之和 (Javascript, Java, C#, Swift, Kotlin, Python,C++, Golang)

給定一個整數數組，返回兩個數字的索引，以便它們加起來成為一個特定的目標。

您可以假定每個輸入都只有一個解決方案，並且您可能不會兩次使用同一元素。

舉例:

給定數組 =[2, 7, 11, 15], 目標值 = 9,

因為nums[0]+ nums[1] = 2 + 7 = 9,

所以返回 [0,1].

思路:

我們定義一個字典來存儲元素及其索引。

我們將一一檢查元素。

假設當前元素是a;

我們將元素及其索引存儲到字典中；

並使用目標減去當前元素來獲得差值b；

我們檢查映射是否可以使用b作為鍵來獲取任何內容，如果該值不為空並且其索引也不相同，則得到答案。

Javascript:

twoSum =(nums, target)=> {

let map = newMap;

for(let i = 0; i< nums.length; i ++) {

let a = nums[i];

let b = target - a;

let j = map.get(b);

if(j !== undefined) {

if(j !== i){

return [i, j ];

}

}

map.set(a, i);

}

return [];

}

console.log(twoSum([2,7,11,15],9))

console.log(twoSum([3,2,4],6))

console.log(twoSum([3,3],6))

Java:

importjava.util.*;

public classHelloWorld{

publicstatic void main(String []args){

System.out.println(Arrays.toString(twoSum(newint[]{2,7,11,15}, 9)));

System.out.println(Arrays.toString(twoSum(newint[]{3,2,4}, 6)));

System.out.println(Arrays.toString(twoSum(newint[]{3,3}, 6)));

}

public static int[] twoSum(int[] nums, inttarget) {

Map<integer> map = new HashMap<integer>();/<integer>/<integer>

for(int i = 0 ; i<nums.length>

int a = nums[i];

int b = target - a;

Integer j = map.get(b);

map.put(a, i);

if(j != null && i != j) {

return new int[]{i,j};

}

}

return new int[]{};

}

}

c#:

usingSystem;

usingSystem.Collections.Generic;

classHelloWorld {

public staticvoid Main(string[] args)

{

Console.WriteLine(string.Join(",",twoSum(newint[]{2,7,11,15}, 9)));

Console.WriteLine(string.Join(",",twoSum(new int[]{3,2,4},6)));

Console.WriteLine(string.Join(",",twoSum(new int[]{3,3},6)));

}

public staticint[] twoSum(int[] nums, inttarget) {

Dictionary map= new Dictionary();

for(inti = 0 ; i<nums.length>

int a = nums[i];

int b = target - a;

if(map.ContainsKey(b)) {

int j = map[b];

if(i != j) {

return new int[]{i,j};

}

}

map[a] = i;

}

returnnew int[]{};

}

}

Swift:

importFoundation

functwoSum(_ nums: [Int], _ target:Int) -> [Int] {

var map = [Int :Int]()

for (i, a) innums.enumerated() {

var b = target - a;

var j = map[b]

if(j != nil) {

var jj = j!

return [i,jj]

}

map[a] = i

}

return []

}

print(twoSum([2,7,11,15],9))

print(twoSum([3,2,4],6))

print(twoSum([3,3],6))

Kotlin:

funtwoSum(nums: IntArray, target:Int): IntArray {

valmap:HashMap =HashMap()

for ((i, a) innums.withIndex()) {

varb = target - a

var j = map.get(b)

if(j != null) {

var jj = j!!

if(jj != i){

return intArrayOf(i, j)

}

}

map.set(a, i)

}

returnintArrayOf()

}

fun main() {

println(twoSum(intArrayOf(2,7,11,15),9).joinToString(","))

println(twoSum(intArrayOf(3,2,4),6).joinToString(","))

println(twoSum(intArrayOf(3,3),6).joinToString(","))

}

Python:

deftwoSum(nums, target):

map = {}

i = 0

l = len(nums)

while i < l:

a = nums[i]

b = target - a

j = map.get(b)

if j is not None:

if j != i:

return [i,j]

map[a] = i

i += 1

return[]

print(twoSum([2,7,11,15],9))

print(twoSum([3,2,4],6))

print(twoSum([3,3],6))

C++:

#include<iostream>

#include<vector>

#include

usingnamespace std;

vectortwoSum(vector&nums, int target) {

std:map map;

vectorret;

for(int i = 0; i< nums.size(); i ++) {

int a = nums[i];

int b = target - a;

std::map::iterator it =map.find(b);

if(it != map.end()) {

int j = it->second;

if(j != i) {

ret.push_back(i);

ret.push_back(j);

return ret;

}

}

map.insert(std::pair(a,i));

}

return ret;

}

int main()

{

{

std::vector nums;

nums.push_back(2);

nums.push_back(7);

nums.push_back(11);

nums.push_back(15);

std::vector ret =twoSum(nums, 9);

for (std::vector::iteratorit = ret.begin() ; it != ret.end(); ++it){

std::cout << *it <

}

std::cout << '\\n';

}

{

std::vector nums;

nums.push_back(3);

nums.push_back(2);

nums.push_back(4);

std::vector ret =twoSum(nums, 6);

for (std::vector::iteratorit = ret.begin() ; it != ret.end(); ++it){

std::cout << *it <

}

std::cout << '\\n';

}

{

std::vector nums;

nums.push_back(3);

nums.push_back(3);

std::vector ret =twoSum(nums, 6);

for (std::vector::iteratorit = ret.begin() ; it != ret.end(); ++it){

std::cout << *it <

}

std::cout << '\\n';

}

return 0;

}

Golang:

package main

import (

"fmt"

)

functwoSum(nums []int, target int)[]int {

var mapCheck = make(map[int]int)

var a int

var b int

for i:=0; i < len(nums) ; i ++ {

a = nums[i]

b = target - a

if j, ok := mapCheck[b]; ok {

if( j != i){

return[]int{i,j}

}

}

mapCheck [a] = i

}

return []int{}

}

func main(){

fmt.Println(twoSum([]int{2,7,11,15},9))

fmt.Println(twoSum([]int{3,2,4}, 6))

fmt.Println(twoSum([]int{3,3}, 6))

}

/<nums.length>

/<nums.length>