python leetcode practice

標籤：

preface:leetcode練習https://leetcode.com/problemset/algorithms/

question:1.Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

coding:

class Solution:    # @return a tuple, (index1, index2)    def twoSum(self, num, target):        index1 = -1        index2 = -1        num_dict = {}        num_len =len(sum)        for i in range(num_len):            temp = {num[i]:i}            num_dict.update{temp}        for i in num_dict:            if target-i in num_dict and num_dict[i]!=num_dict[target-i]:                index1 = num_dict[i]                index2 = num_dict[target-i]                break            else:                print "without suitable answer"        return (index1,index2)

不知為何一直提醒

Runtime Error Message:	Line 10: SyntaxError: invalid syntax
Last executed input:	[3,2,4], 6

先mark，有空再想，進入next題

python leetcode practice