15. 3Sum

这道题最难的是所求解不能包含重复的triplets。

原题

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.

Example1：

For example, given array S = [-1, 0, 1, 2, -1, -4],

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

Example2：

For example, given array S = [0,0,0,0],

A solution set is: [ [0, 0, 0]]

代码实现

        //S = [-1, 0, 1, 2, -1, -4]
        //S = [-2, 0, 0, 2, 2]
        //S= [-2, 0, 1, 1, 2]
        public IList<IList<int>> ThreeSum(int[] nums)
        {
            Array.Sort(nums); //sort nums
            IList<IList<int>> rtn = new List<IList<int>>();
            for (int i = 0; i < nums.Length - 2; i++)
            {
                while (i > 0 && i < nums.Length - 2 && nums[i] == nums[i - 1])
                    i++; //duplicate check
                int lo = i + 1, hi = nums.Length - 1;
                int partsum = 0 - nums[i];
                while (lo < hi)
                {
                    if (nums[lo] + nums[hi] == partsum)
                    {
                        rtn.Add(new List<int>() { nums[i], nums[lo], nums[hi] });
                        //considering this condition: [-3,0,1,1,1,1,2,2,2,2]
                        while (lo < hi && nums[lo] == nums[lo + 1])
                            lo++;
                        while (lo < hi && nums[hi] == nums[hi - 1])
                            hi--;

                        lo++; hi--;
                    }
                    else if (nums[lo] + nums[hi] < partsum)
                        lo++;
                    else
                        hi--;
                }
            }
            return rtn;
        }

13.Roman to Integer
http://blog.csdn.net/daigualu/article/details/72867026

题库

Leetcode算法题目解决方案每天更新在github库中，欢迎感兴趣的朋友加入进来，也欢迎star，或pull request。https://github.com/jackzhenguo/leetcode-csharp

完成题目索引

http://blog.csdn.net/daigualu/article/details/73008186