James Pan

原题网址：https://leetcode.com/problems/3sum-smaller/ Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0  that satisfy the condition nums[i] + nums[j]