题目

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:

Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
The solution set must not contain duplicate triplets.

    For example, given array S = {-1 0 1 2 -1 -4},A solution set is:(-1, 0, 1)(-1, -1, 2)

代码

public class Solution {public List<List<Integer>> threeSum(int[] num) {Arrays.sort(num);int a,b,c;HashSet<List<Integer>> hs=new HashSet();for(int i=0;i<=num.length-3;i++){a=num[i];for(int m=i+1,n=num.length-1; m<n;){b=num[m];c=num[n];if(-a==(b+c)){List<Integer> ls=new ArrayList<Integer>();ls.add(a);ls.add(b);ls.add(c);hs.add(ls);n--;m++;}else if(-a>(b+c)){m++;}else{n--;}}}List<List<Integer>> result=new ArrayList(hs);return result;
}}

代码下载：https://github.com/jimenbian/GarvinLeetCode

/********************************

* 本文来自博客 “李博Garvin“

* 转载请标明出处:http://blog.csdn.net/buptgshengod

******************************************/

【LeetCode从零单排】No15 3Sum相关推荐

【LeetCode从零单排】No198.House Robber No91.Decode Ways139 word break（动态规划典型应用）
1.题目一道典型的Dynamic Programming的题目. You are a professional robber planning to rob houses along a stree ...
【LeetCode从零单排】No70.ClimbingStairs
题目爬楼梯问题,这是一道很有趣的问题.首先看题目: You are climbing a stair case. It takes n steps to reach to the top. Each ...
【LeetCode从零单排】No26.Remove Duplicates from Sorted Array
题目题目要求:去除sort int数组中的重复项. Given a sorted array, remove the duplicates in place such that each ...
【LeetCode从零单排】No.7 Reverse Integer
前话今天开始励志刷一下leetcode上面的题目(还好这个网站没被TG和谐).从easy的开始,数一下差不多有40道,争取两个月搞定. 题目没想到做的第一道题目,虽然看似 ...
【LeetCode从零单排】No.135Candy(双向动态规划)
1.题目 There are N children standing in a line. Each child is assigned a rating value. You are giving ...
【LeetCode从零单排】No22.Generate Parentheses
题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parent ...
【LeetCode从零单排】No221.Maximal Square
题目 Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and ...
【LeetCode从零单排】No133. clon graph (BFS广度优先搜索)
背景 (以下背景资料转载自:http://www.cnblogs.com/springfor/p/3874591.html?utm_source=tuicool) DFS(Dpeth-first Se ...
【LeetCode从零单排】No121 Best Time to Buy and Sell Stock
题目 Say you have an array for which the ith element is the price of a given stock on day i. If you we ...

【LeetCode从零单排】No15 3Sum

题目

代码

【LeetCode从零单排】No15 3Sum相关推荐

最新文章

热门文章