class Solution {
\n public List<List<Integer>> threeSum(int[] nums) {
\n int n = nums.length;<\/p>\n
\/\/ \u5148\u628a\u6570\u7ec4\u5347\u5e8f\u6392\u5e8f，\u662f\u53cc\u6307\u9488\u7684\u524d\u63d0，\u65b9\u4fbf\u53bb\u91cd\u548c\u79fb\u52a8\u6307\u9488
\n Arrays.sort(nums); <\/p>\n
List<List<Integer>> ans = new ArrayList<List<Integer>>(); <\/p>\n
\/\/\u679a\u4e3e\u7b2c\u4e00\u4e2a\u6570
\n for (int first = 0; first < n; ++first) {
\n \/\/ a\u53bb\u91cd：\u5982\u679c\u5f53\u524da\u548c\u4e0a\u4e00\u8f6ea\u76f8\u540c，\u76f4\u63a5\u8df3\u8fc7，\u907f\u514d\u4ea7\u51fa\u4e00\u6837\u7684\u4e09\u5143\u7ec4
\n if (first > 0 && nums[first] == nums[first – 1]) {
\n continue;
\n }<\/p>\n
int third = n – 1; <\/p>\n
\/\/ \u76ee\u6807：b + c = -a，\u4e5f\u5c31\u662f a+b+c=0
\n int target = -nums[first]; <\/p>\n
\/\/ \u679a\u4e3e\u7b2c\u4e8c\u4e2a\u6570
\n for (int second = first + 1; second < n; ++second) {
\n \/\/ b\u53bb\u91cd
\n if (second > first + 1 && nums[second] == nums[second – 1]) {
\n continue;
\n }<\/p>\n
\/\/ \u6838\u5fc3\u53cc\u6307\u9488：b+c > target，\u8bf4\u660ec\u592a\u5927\u4e86，c\u5de6\u79fb\u53d8\u5c0f
\n \/\/ \u6761\u4ef6 second < third：\u5fc5\u987b\u4fdd\u8bc1b\u5728c\u5de6\u8fb9，\u4e0d\u80fd\u91cd\u5408
\n while (second < third && nums[second] + nums[third] > target) {
\n –third;
\n }<\/p>\n
if (second == third) {
\n break;
\n }<\/p>\n
if (nums[second] + nums[third] == target) {
\n List<Integer> list = new ArrayList<Integer>();
\n list.add(nums[first]);
\n list.add(nums[second]);
\n list.add(nums[third]);
\n ans.add(list);
\n }
\n }
\n }
\n return ans;
\n }
\n}<\/p>\n
\u00a0<\/p>\n
\u00a0<\/p>\n
\u00a0<\/p>\n","protected":false},"excerpt":{"rendered":"
class Solution {public List<List> threeSum(int[] nums) {int n nums.length;\/\/ \u5148\u628a\u6570\u7ec4\u5347\u5e8f\u6392\u5e8f，\u662f\u53cc\u6307\u9488\u7684\u524d\u63d0，\u65b9\u4fbf\u53bb\u91cd\u548c\u79fb\u52a8\u6307\u9488Arrays.sort(nums); List<List> ans new ArrayList<List>(); \/\/\u679a\u4e3e\u7b2c\u4e00\u4e2a\u6570for (int first 0; first < n;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[2692,1813,427],"topic":[],"class_list":["post-121622","post","type-post","status-publish","format-standard","hentry","category-server","tag-leetcode","tag-1813","tag-427"],"yoast_head":"\n