rename

Author: fishercoder1534

README.md

@@ -213,7 +213,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |392|[Is Subsequence](https://leetcode.com/problems/is-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_392.java)| O(m*n)|O(1) | Medium| Array, String
 |390|[Elimination Game](https://leetcode.com/problems/elimination-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_390.java)| O(logn)|O(1) | Medium|
 |389|[Find the Difference](https://leetcode.com/problems/find-the-difference/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_389.java)| O(n)|O(1) | Easy|
-|388|[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LongestAbsoluteFilePath.java)| O(n)|O(d) | Medium| Stack
+|388|[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_388.java)| O(n)|O(d) | Medium| Stack
 |387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_387.java)| O(n)|O(n) | Easy| HashMap
 |386|[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_386.java)| O(n)|O(1) | Medium| 
 |385|[Mini Parser](https://leetcode.com/problems/mini-parser/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_385.java)| O(n)|O(h) | Medium| Stack

…r/solutions/LongestAbsoluteFilePath.java …java/com/fishercoder/solutions/_388.javasrc/main/java/com/fishercoder/solutions/LongestAbsoluteFilePath.java renamed to src/main/java/com/fishercoder/solutions/_388.java src/main/java/com/fishercoder/solutions/LongestAbsoluteFilePath.java renamed to src/main/java/com/fishercoder/solutions/_388.java

@@ -4,7 +4,7 @@
 
 import java.util.Stack;
 
-public class LongestAbsoluteFilePath {
+public class _388 {
     public static int lengthLongestPath(String input) {
         Stack<Integer> stack = new Stack();
         int longestLen = 0, currDirLen = 0;