> For the complete documentation index, see [llms.txt](https://liuyang89116.gitbook.io/my-leetcode-book/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://liuyang89116.gitbook.io/my-leetcode-book/chapter_8_high_frequency/two-sum/problem-259-3sum-smaller.md).

# Problem 259: 3Sum Smaller

> <https://leetcode.com/problems/3sum-smaller/#/description>

![](/files/-Lpv9yN2GNzrnAlDXui0)

## 思路

* 双指针法：遍历 i 的时候， 用 left 和 right 从两边向中间逼近
* 注意：一定要 sort 原来的 Array

```java
public class Solution {
    public int threeSumSmaller(int[] nums, int target) {
        if (nums == null || nums.length == 0) return 0;
        int count = 0, len = nums.length;

        Arrays.sort(nums);
        for (int i = 0; i < len - 2; i++) {
            int left = i + 1, right = len - 1;
            while (left < right) {
                int sum = nums[i] + nums[left] + nums[right];
                if (sum < target) {
                    count += right - left;
                    left++;
                } else {
                    right--;
                }
            }
        }

        return count;
    }
}
```