Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package javaSol;
- import edu.princeton.cs.algs4.BinarySearch;
- import edu.princeton.cs.algs4.In;
- import edu.princeton.cs.algs4.StdOut;
- import java.util.Arrays;
- public class Fast {
- public static class ThreeSumFast {
- public static int count(int[] a) { // Count triples that sum to 0.
- Arrays.sort(a);
- int N = a.length;
- int cnt = 0;
- for (int i = 0; i < N; i++)
- for (int j = i + 1; j < N; j++)
- for(int k = j +1; j < N; k++)
- if (BinarySearch.rank(-a[i] - a[j] - a[k], a) > k)
- cnt++;
- return cnt;
- }
- public static void main(String[] args) {
- int[] a = In.readInts(args[0]);
- StdOut.println(count(a));
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement