feat(01/2015): solve second part

Author: manhunto

readme.md

@@ -87,7 +87,7 @@
 
 | Day                                                      | Solved | Part 1 time (ms) | Part 2 time (ms) |
 |----------------------------------------------------------|:------:|-----------------:|-----------------:|
-| [Day 1: Not Quite Lisp](src/solutions/year2015/day01.rs) |   ⭐    |            0.013 |                - |
+| [Day 1: Not Quite Lisp](src/solutions/year2015/day01.rs) |   ⭐⭐   |            0.013 |            0.001 |
 
 # TODO
 

src/solutions/year2015/day01.rs

@@ -15,8 +15,22 @@ impl Solution for Day01 {
             .to_string()
     }
 
-    fn part_two(&self, _input: &str) -> String {
-        String::from("0")
+    fn part_two(&self, input: &str) -> String {
+        let mut current_flor = 0;
+
+        for (i, b) in input.bytes().enumerate() {
+            current_flor += match b {
+                b'(' => 1,
+                b')' => -1,
+                _ => 0,
+            };
+
+            if current_flor == -1 {
+                return (i + 1).to_string();
+            }
+        }
+
+        unreachable!()
     }
 }
 
@@ -36,4 +50,10 @@ mod tests {
         assert_eq!("-3", Day01.part_one(")))"));
         assert_eq!("-3", Day01.part_one(")())())"));
     }
+
+    #[test]
+    fn part_two_example_test() {
+        assert_eq!("1", Day01.part_two(")"));
+        assert_eq!("5", Day01.part_two("()())"));
+    }
 }