Added Java solutions from Anton

[ou-summer-of-code-2017.git] / anton / SummerOfCode / src / summerofcode / Day2.java

diff --git a/anton/SummerOfCode/src/summerofcode/Day2.java b/anton/SummerOfCode/src/summerofcode/Day2.java
new file mode 100644 (file)
index 0000000..3a9aa62
--- /dev/null
+++ b/anton/SummerOfCode/src/summerofcode/Day2.java
@@ -0,0 +1,46 @@
+package summerofcode;\r
+\r
+import java.io.FileReader;\r
+import java.util.Scanner;\r
+\r
+/**\r
+ *\r
+ * @author Anton Dil\r
+ */\r
+public class Day2\r
+{\r
+   public static void main(String[] args) throws Exception\r
+   {\r
+      Scanner sc = new Scanner(new FileReader("02-lifts.txt"));\r
+      int exit = Integer.MIN_VALUE; //replaceable floor value\r
+      String input = "";\r
+      int floor = 0;\r
+\r
+      while (sc.hasNext())\r
+      {\r
+         input = sc.next(); //just one line of input in fact\r
+      }\r
+\r
+      System.out.println("Input was " + input);\r
+\r
+      for (char ch : input.toCharArray())\r
+      {\r
+         switch (ch)\r
+         {\r
+            case 'v':\r
+               floor--;\r
+               break;\r
+            case '^':\r
+               floor++;\r
+               break;\r
+            case '=':\r
+               if (floor > exit)\r
+               {\r
+                  exit = floor;\r
+               }\r
+         }\r
+      }\r
+\r
+      System.out.printf("final floor %d, highest exit %d%n", floor, exit);\r
+   }\r
+}\r