Leetcode 15. 3Sum(python)

來源:互聯網
上載者:User

標籤:

先排序,再迴圈遍曆,用雙指標。

class Solution(object):    def threeSum(self, nums):        """        :type nums: List[int]        :rtype: List[List[int]]        """        solution=[]        nums.sort()        for i in range(len(nums)-1):            left=i+1            right=len(nums)-1            while left<right:                val=nums[i]+nums[left]+nums[right]                if val==0 and [nums[i],nums[left],nums[right]] not in solution:                    solution.append([nums[i],nums[left],nums[right]])                    left+=1                    right-=1                elif val<0:                    left+=1                else:                    right-=1        return solution        

  

Leetcode 15. 3Sum(python)

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.