add 2139

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2139|[Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2139.java) ||Medium||
 |2138|[Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2138.java) ||Easy||
 |2134|[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2134.java) ||Medium||
 |2133|[Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2133.java) ||Easy||

src/main/java/com/fishercoder/solutions/_2139.java

@@ -0,0 +1,24 @@
+package com.fishercoder.solutions;
+
+public class _2139 {
+    public static class Solution1 {
+        public int minMoves(int target, int maxDoubles) {
+            int minMoves = 0;
+            while (target != 1) {
+                if (maxDoubles > 0) {
+                    if (target % 2 == 0) {
+                        target /= 2;
+                        maxDoubles--;
+                    } else {
+                        target--;
+                    }
+                } else {
+                    minMoves += target - 1;
+                    break;
+                }
+                minMoves++;
+            }
+            return minMoves;
+        }
+    }
+}