diff options
| author | Jérémy Zurcher <jeremy@asynk.ch> | 2013-03-11 16:35:20 +0100 |
|---|---|---|
| committer | Jérémy Zurcher <jeremy@asynk.ch> | 2013-11-15 17:38:44 +0100 |
| commit | 2c6ade9c0d7fc0b7abd2269c7c8a7cb415cbecbd (patch) | |
| tree | 82006f65a6524b555517559ccc3f16c95a9a70eb | |
| parent | 2e2b1df2647f2ee3a25517020ca4b2e66b421fcb (diff) | |
| download | coursera-2c6ade9c0d7fc0b7abd2269c7c8a7cb415cbecbd.zip coursera-2c6ade9c0d7fc0b7abd2269c7c8a7cb415cbecbd.tar.gz | |
Algorithms-I : 3-Collinear: hide api
| -rw-r--r-- | Algorithms/Part-I/3-Collinear/Fast.java | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Algorithms/Part-I/3-Collinear/Fast.java b/Algorithms/Part-I/3-Collinear/Fast.java index 6d9dcac..07130a6 100644 --- a/Algorithms/Part-I/3-Collinear/Fast.java +++ b/Algorithms/Part-I/3-Collinear/Fast.java @@ -7,7 +7,7 @@ import java.util.Arrays; public class Fast { - static class Segment + private static class Segment { private Point[] pts; @@ -61,7 +61,7 @@ public class Fast } } - static List<Segment> solve(Point[] pts, int N) + private static List<Segment> solve(Point[] pts, int N) { List<Segment> segments = new ArrayList<Segment>(); for (int i = 0; i < N - 1; i++) |