Advertisement
Guest User

Untitled

a guest
Feb 17th, 2020
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.81 KB | None | 0 0
  1. package javaSol;
  2. import edu.princeton.cs.algs4.BinarySearch;
  3. import edu.princeton.cs.algs4.In;
  4. import edu.princeton.cs.algs4.StdOut;
  5. import java.util.Arrays;
  6.  
  7. public class Fast {
  8. public static class ThreeSumFast {
  9. public static int count(int[] a) { // Count triples that sum to 0.
  10. Arrays.sort(a);
  11. int N = a.length;
  12. int cnt = 0;
  13. for (int i = 0; i < N; i++)
  14. for (int j = i + 1; j < N; j++)
  15. for(int k = j +1; j < N; k++)
  16. if (BinarySearch.rank(-a[i] - a[j] - a[k], a) > k)
  17. cnt++;
  18. return cnt;
  19. }
  20.  
  21. public static void main(String[] args) {
  22. int[] a = In.readInts(args[0]);
  23. StdOut.println(count(a));
  24. }
  25. }
  26. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement