leetcode.jp 博客
本网站所有文字及图片内容均来自网络,每周定时更新,仅供个人学习与研究,请勿用于商业用途。谢谢合作。

15. 3Sum

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

The solution set must not contain duplicate triplets.

Example:

Given array nums = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
  [-1, 0, 1],
  [-1, -1, 2]
]

Difficulty:

Medium

Lock:

Normal

Company:

Adobe Akuna Capital Alibaba Amazon Apple Baidu Bloomberg ByteDance Cisco Citadel Coursera DoorDash eBay Expedia Facebook Goldman Sachs Google Groupon IBM Mathworks Microsoft Oracle Paypal Postmates Qualtrics Quora Salesforce Snapchat Splunk Square Tencent Uber Visa Walmart Labs Works Applications Yahoo Yandex

Solution(Chinese):

LEETCODE 15. 3Sum 解题思路分析