python leetcode1

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.

# author:wei
class Solution:
   def twoSum(self,list,target):

        for j in range(len(list)-1):
            if target==list[j]+list[j+1]:
                print(j,j+1)
a=Solution()
a.twoSum([1,2,3,4,7,100,6,356,24,56,44],100)