2017-09-09 LeetCode_015 3Sum

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]
]

Solution:

class Solution {

2

public:

3

    vector<vector<int> > threeSum(vector<int>& nums) {

4

        vector<vector<int> > ans;

5

        if (nums.size() == 0) return ans;

6

        for (int i = 0; i < nums.size()-1; i++)

7

            for (int j = 0; j < nums.size()-i-1; j++)

8

                if (nums[j] > nums[j+1]) {

9

                    int t = nums[j]; nums[j] = nums[j+1]; nums[j+1] = t;

10

                }

11

        for (int b = 1; b < nums.size()-1;) {

12

            int tb = nums[b];

13

            int a = 0, c = nums.size()-1;

14

            if (tb < 0) {

15

                while (tb == nums[b] && b < nums.size()-1) b++;

16

                b--;

17

            } else if (tb == 0) {

18

                if (b+1 < nums.size()-1 && nums[b+1] == 0) b++;

19

            }

20

            while (a < b && b < c) {

21

                if (nums[a]+nums[b]+nums[c] == 0) {

22

                    vector<int> temp;

23

                    temp.push_back(nums[a]); temp.push_back(nums[b]); temp.push_back(nums[c]);

24

                    ans.push_back(temp);

25

                    int ta = nums[a];

26

                    while (ta == nums[a] && a < b) a++;

27

                } else if (nums[a]+nums[b]+nums[c] < 0) {

28

                    int ta = nums[a];

29

                    while (ta == nums[a] && a < b) a++;

30

                } else {

31

                    int tc = nums[c];

32

                    while (tc == nums[c] && b < c) c--;

33

                }

34

            }

35

            if (tb < 0) b++;

36

            else {

37

                while (tb == nums[b] && b < nums.size()-1) b++;

38

            }

39

        }

40

        return ans;

41

    }

42

};