1. 程式人生 > >leetcode程式設計-1 python

leetcode程式設計-1 python

題目
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.

Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
程式碼

a = [2,7,11,15]
b = 9
for i in range(0,len(a)):
    for j in range(0,len(a)):
        if (i != j and a[i] + a[j] != b):
            print(i,j)