Leetcode -- 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:
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)

分析：
数组，找到三个数，使得和等于0。返回的是数，要求不能重复(The solution set much not contain duplicate triplets.)

思路：
排序，然后两个指针，一个从头遍历，一个从尾巴遍历，找到那些满足要求的数。注意，再遍历的时候，应该跳过那些数值相同的数。

代码：

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
     vector <vector<int> > result;
       int len = nums.size();
       if(len<3)
       {
           return result;
       }
       int front, back;
       int sum, target;
       sort(nums.begin(), nums.end());

       for(int i = 0; i< len; i++)
       {
           front = i + 1;
           back = len -1;
           target = -nums[i];
           while(front < back)
           {
              sum = nums[front] + nums[back];
              if(sum < target)
              {
                  front ++;
              }
              if(sum > target)
              {
                  back --;
              }
              if(sum == target)
              {
                  vector<int> arr(3, 0);
                  arr[0] = nums[i];
                  arr[1] = nums[front];
                  arr[2] = nums[back];
                  result.push_back(arr);

                  while(nums[front] == arr[1] && front<back) front ++;
                  while(nums[back] == arr[2] && front < back) back --;
              }
           }
           while((i+1)<len && nums[i+1] == nums[i])
           {
               i = i+ 1;
           }
       }
       return result;
    }
};

分析：
我不会用hashtable解这道题，求指导。
此外，个人在怀疑，hashtable是否可以求解这道题。如果，数组是{0, 0, 0}，hashtable应该怎么存储两个相同的0呢？