[3sum] Add 3sum and its variation solutions.

3sum is a kind of subset sum problem. subset problem is NP-complete.

For 3sum and k-sum problem, we can use reduce to 2sum, and using two
scan method to solve it in O(n^(k-1)).