Leetcode 15 3Sum

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 example, given array S = [-1, 0, 1, 2, -1, -4],

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

思路：

1 边界条件检查

2 排序nlogn

3 通过i,left, right三根指针和while循环来解决问题；

注意事项：需要注意跳过重复值的coner case问题;

 public IList<IList<int>> ThreeSum(int[] num) {
            IList<IList<int>> rst = new List<IList<int>>();  
            if (num == null || num.Length < 3)  
            {  
                return rst;  
            }  
            //排序  
            Array.Sort(num);  
            for (int i = 0; i < num.Length - 2; i++)  
            {  
                // 如果数组中第i和第i-1个元素相等，则跳过这个重复元素  
                if (i > 0 && num[i] == num[i - 1])  
                {  
                    continue; // to skip duplicate numbers; e.g [0,0,0,0]  
                }  
  
                int left = i + 1;  
                int right = num.Length - 1;  
                while (left < right)  
                {  
                    int sum = num[left] + num[right] + num[i];  
                    if (sum == 0)  
                    {  
                        List<int> tmp = new List<int>();  
                        tmp.Add(num[i]);  
                        tmp.Add(num[left]);  
                        tmp.Add(num[right]);  
                        rst.Add(tmp);  
                        left++;  
                        right--;  
                        while (left < right && num[left] == num[left - 1])  
                        { // to skip duplicates  
                            left++;  
                        }  
                        while (left < right && num[right] == num[right + 1])  
                        { // to skip duplicates  
                            right--;  
                        }  
                    }  
                    else if (sum < 0)  
                    {  
                        left++;  
                    }  
                    else  
                    {  
                        right--;  
                    }  
                }  
            }  
            return rst;  
    }