【Leetcode】1.两数之和

C++版:

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
      int i,j;
      vector<int> s;
      for(i=0;i<nums.size();i++)
      {
          for(j=i+1;j<nums.size();j++)
          {
              if(nums[i]+nums[j]==target)
              { 
                   s.push_back(i);
                   s.push_back(j);
              } 
          }
      }
      return s;
    }
};

 python版：

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        n = len(nums)
        for x in range(n):
            for y in range(x+1,n):
               if(nums[x]+nums[y]==target):
                   return x,y