Leetcode 15 [medium]--3Sum
2018-02-04 23:22
393 查看
Given an array S of n integers, are there elements a, b, c in S 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.
思路: 本题不可能设置三个for 循环,会严重超时。先将array sort,设置一个for 循环,两个指针。三个数相加,根据和的大小调整指针的位置。最后注意避免因为array中的重复元素而造成的重复结果。如果元素与前一个元素相同,用continue 跳出该轮循环的剩余任务,继续进行下一轮循环(break 跳出整个循环)
Note: The solution set must not contain duplicate triplets.
思路: 本题不可能设置三个for 循环,会严重超时。先将array sort,设置一个for 循环,两个指针。三个数相加,根据和的大小调整指针的位置。最后注意避免因为array中的重复元素而造成的重复结果。如果元素与前一个元素相同,用continue 跳出该轮循环的剩余任务,继续进行下一轮循环(break 跳出整个循环)
相关文章推荐
- Leetcode: 15. 3Sum(Week3,Medium)
- LeetCode-15-3Sum(证明/KSum)-Medium
- [LeetCode]15 3Sum
- [LeetCode] 015--3Sum --Medium--
- [Leetcode] 15. 3Sum
- LeetCode 15 3Sum (C,C++,Java,Python)
- leetcode-15 3Sum
- LeetCode 15 3Sum
- LeetCode 15 - 3Sum
- [Leetcode] 15. 3Sum
- Leetcode: 73. Set Matrix Zeroes(Week15, Medium)
- LeetCodet题解--15. 3Sum
- 3Sum_Leetcode_#15
- 【leetcode】【15】3Sum
- LeetCode-15-3Sum
- LeetCode之15_3Sum
- Leetcode-15: 3Sum
- LeetCode-15 3Sum(求3数和为零的情况总数)
- LeetCode15:3Sum
- LeetCode 15. 3Sum (Medium)