add 1756

fishercoder1534 · fishercoder1534 · commit 92ad82fa0ae5 · 2021-02-28T16:56:23.000-08:00
diff --git a/README.md b/README.md
@@ -17,6 +17,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1763|[Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1763.java) ||Easy|String|
 |1759|[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) ||Medium|String ,Greedy|
 |1758|[Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) ||Easy|Greedy, Array|
+|1756|[Design Most Recently Used Queue](https://leetcode.com/problems/design-most-recently-used-queue/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1756.java) ||Medium|Array, Design, Dequeue|
 |1754|[Largest Merge Of Two Strings](https://leetcode.com/problems/largest-merge-of-two-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) ||Medium|Greedy, Suffix Array|
 |1753|[Maximum Score From Removing Stones](https://leetcode.com/problems/maximum-score-from-removing-stones/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) ||Medium|Math, Heap|
 |1752|[Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1752.java) ||Easy|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_1756.java b/src/main/java/com/fishercoder/solutions/_1756.java
@@ -0,0 +1,26 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _1756 {
+    public static class Solution1 {
+        class MRUQueue {
+            List<Integer> list;
+
+            public MRUQueue(int n) {
+                list = new ArrayList(n);
+                for (int i = 1; i <= n; i++) {
+                    list.add(i);
+                }
+            }
+
+            public int fetch(int k) {
+                int fetched = list.remove(k - 1);
+                list.add(fetched);
+                return fetched;
+            }
+        }
+
+    }
+}
