Adjust SimplifyPath solution to pass tricky tase-case on leetcode

Author: andrei-punko

src/main/java/by/andd3dfx/collections/SimplifyPath.java

@@ -70,11 +70,7 @@ public static String simplifyPath(String path) {
         while (i < chars.length) {
             switch (chars[i]) {
                 case '/':
-                    if (accumulator.toString().equals("..") && !stack.isEmpty()) {
-                        stack.pop();
-                    } else {
-                        checkAndPush(stack, accumulator);
-                    }
+                    process2DotsCase(accumulator, stack);
                     accumulator = new StringBuilder();
                     break;
 
@@ -83,14 +79,22 @@ public static String simplifyPath(String path) {
             }
             i++;
         }
-        checkAndPush(stack, accumulator);
+        process2DotsCase(accumulator, stack);
 
         List<String> folders = Arrays.stream(stack.toArray(new String[0]))
             .toList()
             .reversed();
         return "/" + String.join("/", folders);
     }
 
+    private static void process2DotsCase(StringBuilder accumulator, Deque<String> stack) {
+        if (accumulator.toString().equals("..") && !stack.isEmpty()) {
+            stack.pop();
+        } else {
+            checkAndPush(stack, accumulator);
+        }
+    }
+
     private static void checkAndPush(Deque<String> stack, StringBuilder accumulator) {
         var string = accumulator.toString();
         if (!string.isEmpty() && !string.matches("\\.{1,2}")) {

src/test/java/by/andd3dfx/collections/SimplifyPathTest.java

@@ -15,5 +15,6 @@ public void testSimplifyPath() {
         assertThat(SimplifyPath.simplifyPath("/../")).isEqualTo("/");
         assertThat(SimplifyPath.simplifyPath("/.../a/../b/c/../d/./"))
             .isEqualTo("/.../b/d");
+        assertThat(SimplifyPath.simplifyPath("/a//b////c/d//././/..")).isEqualTo("/a/b/c");
     }
 }