class Solution(object):
def twoSum(self, nums, target):
for i in range(len(nums)):
for j in range(i+1,len(nums)):
if nums[i] + nums[j] == target:
return [i, j]
Python Four Line O(n) Solution ( Shortest, I think ?!? )

@smallknifecutbigtree But it's O(n^2) running time....I would consider this the bruteforce solution