add 4070

Author: fishercoder1534

paginated_contents/algorithms/5th_thousand/README.md

@@ -1,5 +1,6 @@
 | #    | Title                                                                                                                                                                                 | Solutions                                                                                                                        | Video                                | Difficulty | Tag                                                                  
 |------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------|--------------------------------------|------------|----------------------------------------------------------------------
+| 4070 | [Minimum Rotations to Dial a Number I](https://leetcode.com/problems/minimum-rotations-to-dial-a-number-i/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4070.java) |                                      | Easy       |
 | 4065 | [Rearrange Array by Removing Distinct Values](https://leetcode.com/problems/rearrange-array-by-removing-distinct-values/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4065.java) |                                      | Easy       |
 | 4061 | [Minimum Queen Moves to Reach Target](https://leetcode.com/problems/minimum-queen-moves-to-reach-target/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4061.java) |                                      | Easy       |
 | 4056 | [Number of Intersecting Interval Pairs I](https://leetcode.com/problems/number-of-intersecting-interval-pairs-i/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4056.java) |                                      | Easy       |

src/main/java/com/fishercoder/solutions/fifththousand/_4070.java

@@ -0,0 +1,24 @@
+package com.fishercoder.solutions.fifththousand;
+
+public class _4070 {
+    public static class Solution1 {
+        public int minRotations(String s) {
+            int r = 0;
+            for (int i = -1; i < s.length() - 1; i++) {
+                int from = i == -1 ? 0 : Character.getNumericValue(s.charAt(i));
+                int to = Character.getNumericValue(s.charAt(i + 1));
+                int bigger = 0;
+                int smaller = 0;
+                if (from > to) {
+                    bigger = from;
+                    smaller = to;
+                } else if (from < to) {
+                    bigger = to;
+                    smaller = from;
+                }
+                r += Math.min(bigger - smaller, Math.abs(10 - bigger + smaller));
+            }
+            return r;
+        }
+    }
+}