直接上代码:
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class ThreeSumQuickSortME {
public static void main(String[] args) {
int[] arr = {4, 7, 8, 2, -5, 3, 3, 3, 3, 3, 5, 0, 3, 3, 3};
threeSum(arr);
System.out.println(arr[arr.length / 2]);
System.out.println(Arrays.toString(arr));
}
public static List<List<Integer>> threeSum(int[] arr) {
List<List<Integer>> list = new ArrayList<>();
sort(arr);
for (int i = 0; i < arr.length; i++) {
if (arr[i] > 0) continue;
if (i > 0 && arr[i] == arr[i - 1]) continue;
int L = i + 1;
int R = arr.length - 1;
while (L < R) {
if (arr[L] + arr[R] + arr[i] == 0) {
ArrayList<Integer> list1 = new ArrayList<>();
list1.add(arr[L]);
list1.add(arr[R]);
list1.add(arr[i]);
list.add(list1);
while (L < R && arr[L] == arr[L + 1]) L++;
while (L < R && arr[R] == arr[R - 1]) R--;
L++;
R--;
} else if (arr[L] + arr[R] + arr[i] > 0) {
R--;
} else {
L++;
}
}
}
return list;
}
public static void sort(int[] arr) {
quickSort(arr, 0, arr.length - 1);
}
public static void quickSort(int[] arr, int i, int j) {
if (i >= j) return;
int mid = partition(arr, i, j);
quickSort(arr, i, mid - 1);
quickSort(arr, mid + 1, j);
}
public static int partition(int[] arr, int i, int j) {
int left = i;
int base = arr[left];
while (i < j) {
while (i < j && arr[j] >= base) j--;
while (i < j && arr[i] <= base) i++;
swap(arr, i, j);
}
swap(arr, left, j);
return j;
}
private static void swap(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}