solves #2224: Minimum Number of Operations to Convert Time in java

Author: anishLearnsToCode

README.md

@@ -723,7 +723,7 @@
 | 2210 | [Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array)                                                               |                                                                                [![Java](assets/java.png)](src/CountHillsAndValleysInAnArray.java)                                                                                |                                                                                                                                   |
 | 2215 | [Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays)                                                                   |                                                                                [![Java](assets/java.png)](src/FindTheDifferenceOfTwoArrays.java)                                                                                 |                                                                                                                                   |
 | 2220 | [Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number)                                                               |                                                                               [![Java](assets/java.png)](src/MinimumBitFlipsToConvertNumber.java)                                                                                |                                                                                                                                   |
-| 2224 | [Minimum Number of Operations to Convert Time](https://leetcode.com/problems/minimum-number-of-operations-to-convert-time)                                             |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 2224 | [Minimum Number of Operations to Convert Time](https://leetcode.com/problems/minimum-number-of-operations-to-convert-time)                                             |                                                                           [![Java](assets/java.png)](src/MinimumNumberOfOperationsToConvertTime.java)                                                                            |                                                                                                                                   |
 | 2229 | 🔒 [Check if an array is consecutive](https://leetcode.com/problems/check-if-an-array-is-consecutive)                                                                  |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2231 | [Largest Number After Digit Swaps by Parity](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity)                                                 |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2235 | [Add Two Integers](https://leetcode.com/problems/add-two-integers)                                                                                                     |                                                                                                                                                                                                                                  |                                                                                                                                   |

src/MinimumNumberOfOperationsToConvertTime.java

@@ -0,0 +1,23 @@
+// https://leetcode.com/problems/minimum-number-of-operations-to-convert-time
+// T: O(1)
+// S: O(1)
+
+public class MinimumNumberOfOperationsToConvertTime {
+    private final static int[] MINUTE_INCREMENTS = {60, 15, 5, 1};
+
+    public int convertTime(String current, String correct) {
+        final int hour1 = Integer.parseInt(current.substring(0, 2)), hour2 = Integer.parseInt(correct.substring(0, 2));
+        final int minutes1 = Integer.parseInt(current.substring(3)), minutes2 = Integer.parseInt(correct.substring(3));
+        final int totalMinutes1 = hour1 * 60 + minutes1, totalMinutes2 = hour2 * 60 + minutes2;
+
+        int operations = 0;
+        int difference = totalMinutes2 - totalMinutes1;
+
+        for (int i = 0 ; i < MINUTE_INCREMENTS.length && difference > 0; i++) {
+            operations += difference / MINUTE_INCREMENTS[i];
+            difference -= (difference / MINUTE_INCREMENTS[i]) * MINUTE_INCREMENTS[i];
+        }
+
+        return operations;
+    }
+}