add 2120

fishercoder1534 · fishercoder1534 · commit 96c77c99a1d0 · 2021-12-25T20:18:59.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2120|[Execution of All Suffix Instructions Staying in a Grid](https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2120.java) ||Medium||
 |2119|[A Number After a Double Reversal](https://leetcode.com/problems/a-number-after-a-double-reversal/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2119.java) ||Easy||
 |2116|[Check if a Parentheses String Can Be Valid](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2116.java) ||Medium||
 |2114|[Maximum Number of Words Found in Sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2114.java) ||Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_2120.java b/src/main/java/com/fishercoder/solutions/_2120.java
@@ -0,0 +1,54 @@
+package com.fishercoder.solutions;
+
+public class _2120 {
+    public static class Solution1 {
+        public int[] executeInstructions(int n, int[] startPos, String s) {
+            int[] ans = new int[s.length()];
+            for (int i = 0; i < s.length(); i++) {
+                int y = startPos[1];
+                int x = startPos[0];
+                int j = i;
+                boolean broken = false;
+                for (; j < s.length(); j++) {
+                    if (s.charAt(j) == 'R') {
+                        if (y + 1 < n) {
+                            y++;
+                        } else {
+                            ans[i] = j - i;
+                            broken = true;
+                            break;
+                        }
+                    } else if (s.charAt(j) == 'L') {
+                        if (y - 1 >= 0) {
+                            y--;
+                        } else {
+                            ans[i] = j - i;
+                            broken = true;
+                            break;
+                        }
+                    } else if (s.charAt(j) == 'U') {
+                        if (x - 1 >= 0) {
+                            x--;
+                        } else {
+                            ans[i] = j - i;
+                            broken = true;
+                            break;
+                        }
+                    } else if (s.charAt(j) == 'D') {
+                        if (x + 1 < n) {
+                            x++;
+                        } else {
+                            ans[i] = j - i;
+                            broken = true;
+                            break;
+                        }
+                    }
+                }
+                if (!broken) {
+                    ans[i] = j - i;
+                }
+            }
+            return ans;
+        }
+    }
+}
