Count triplets whose sum is less than target — not find them, just count. The trick:
once nums[i]+nums[left]+nums[right] < target, every right value between
left and right also works with this left,
since the array is sorted. That's right - left triplets counted in one shot.