LeetCode 259. 3Sum Smaller

Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0 <= i < j < k < n that satisfy the condition nums[i] + nums[j] + nums[k] < target.

Example:

Input: nums = [-2,0,1,3], and target = 2
Output: 2
Explanation: Because there are two triplets which sums are less than 2:
[-2,0,1]
[-2,0,3]
Follow up: Could you solve it in O(n2) runtime?

public int threeSumSmaller(int[] nums, int target) {
    if (nums.length <= 2) return 0;
    Arrays.sort(nums);
    int result = 0;
    for (int i = nums.length - 1; i >= 2; i--) {
        result += twoSumSmaller(nums, i, target - nums[i]);
    }
    return result;
}
public int twoSumSmaller(int[] nums, int i, int target) {
    int start = 0, end = i - 1, result = 0;
    while (start < end) {
        if (nums[start] + nums[end] < target) {
            result += end - start;
            start++;
        } else {
            end--;
        }
    }
    return result;
}