add 1138

fishercoder1534 · fishercoder1534 · commit b1d989996b60 · 2020-11-19T07:11:44.000-08:00
diff --git a/README.md b/README.md
@@ -223,6 +223,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | |Easy||
 |1150|[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1150.java)|[:tv:](https://youtu.be/-t2cdVs9cKk) |Easy||
 |1146|[Snapshot Array](https://leetcode.com/problems/snapshot-array/)|[Javascript](./javascript/_1146.js)| | Easy ||
+|1138|[Alphabet Board Path](https://leetcode.com/problems/alphabet-board-path/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1138.java)| | Medium |HashTable, String|
 |1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1137.java) | |Easy||
 |1134|[Armstrong Number](https://leetcode.com/problems/armstrong-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1134.java) |  [:tv:](https://www.youtube.com/watch?v=HTL7fd4HPf4)|Easy||
 |1133|[Largest Unique Number](https://leetcode.com/problems/largest-unique-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1133.java) | [:tv:](https://youtu.be/Fecpt1YZlCs)|Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1138.java b/src/main/java/com/fishercoder/solutions/_1138.java
@@ -0,0 +1,73 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _1138 {
+    public static class Solution1 {
+        public String alphabetBoardPath(String target) {
+            Map<Character, int[]> map = initMap();
+            StringBuilder sb = new StringBuilder();
+            int[] currPos = new int[2];
+            for (char c : target.toCharArray()) {
+                moveToDest(currPos, map.get(c), sb);
+            }
+            return sb.toString();
+        }
+
+        private void moveToDest(int[] currPos, int[] dest, StringBuilder sb) {
+            int currRow = currPos[0];
+            int currCol = currPos[1];
+            int destRow = dest[0];
+            int destCol = dest[1];
+            while (currRow != destRow || currCol != destCol) {
+                if (currRow < destRow) {
+                    while (currRow < destRow) {
+                        if (currCol != 0 && currRow == 4) {
+                            break;
+                        }
+                        sb.append("D");
+                        currRow++;
+                    }
+                    currPos[0] = currRow;
+                }
+                if (currRow > destRow) {
+                    while (currRow > destRow) {
+                        sb.append("U");
+                        currRow--;
+                    }
+                    currPos[0] = currRow;
+                }
+                if (currCol < destCol) {
+                    while (currCol < destCol) {
+                        sb.append("R");
+                        currCol++;
+                    }
+                    currPos[1] = currCol;
+                }
+                if (currCol > destCol) {
+                    while (currCol > destCol) {
+                        sb.append("L");
+                        currCol--;
+                    }
+                    currPos[1] = currCol;
+                }
+            }
+            sb.append("!");
+            return;
+        }
+
+        private Map<Character, int[]> initMap() {
+            Map<Character, int[]> map = new HashMap<>();
+            int row;
+            int col;
+            int number = 0;
+            for (char c = 'a'; c <= 'z'; c++, number++) {
+                row = number / 5;
+                col = number % 5;
+                map.put(c, new int[]{row, col});
+            }
+            return map;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1138Test.java b/src/test/java/com/fishercoder/_1138Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1138;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1138Test {
+    private static _1138.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1138.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals("DDR!UURRR!!DDD!", solution1.alphabetBoardPath("leet"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals("DDDDD!UUUUURRR!DDDDLLLD!", solution1.alphabetBoardPath("zdz"));
+    }
+
+}
