_1138.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.HashMap;
importjava.util.Map;

publicclass_1138 {
publicstaticclassSolution1 {
publicStringalphabetBoardPath(Stringtarget) {
Map<Character, int[]> map = initMap();
StringBuildersb = newStringBuilder();
int[] currPos = newint[2];
for (charc : target.toCharArray()) {
moveToDest(currPos, map.get(c), sb);
 }
returnsb.toString();
 }

privatevoidmoveToDest(int[] currPos, int[] dest, StringBuildersb) {
intcurrRow = currPos[0];
intcurrCol = currPos[1];
intdestRow = dest[0];
intdestCol = 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;
 }

privateMap<Character, int[]> initMap() {
Map<Character, int[]> map = newHashMap<>();
introw;
intcol;
intnumber = 0;
for (charc = 'a'; c <= 'z'; c++, number++) {
row = number / 5;
col = number % 5;
map.put(c, newint[] {row, col});
 }
returnmap;
 }
 }
}