solves #2739: TotalDistanceTravele in java

Author: anishLearnsToCode

README.txt

@@ -831,8 +831,8 @@
 | 2717 | [Semi-Ordered Permutation](https://leetcode.com/problems/semi-ordered-permutation)                                                                                     |                                                                                   [![Java](assets/java.png)](src/SemiOrderedPermutation.java)                                                                                                                                               |                                                                                                                                   |
 | 2728 | [Count Houses in a Circular Street](https://leetcode.com/problems/count-houses-in-a-circular-street)                                                                   |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2729 | [Check if The Number is Fascinating](https://leetcode.com/problems/check-if-the-number-is-fascinating)                                                                 |                                                                                   [![Java](assets/java.png)](src/CheckIfTheNumberIsFascinating.java)                                                                                                                                               |                                                                                                                                   |
-| 2733 | [Neither Minimum nor Maximum](https://leetcode.com/problems/neither-minimum-nor-maximum)                                                                               |                                                                                   [![Java](assets/java.png)](src/NeitherMinimumNorMaximum.java    )                                                                                                                                               |                                                                                                                                   |
-| 2739 | [Total Distance Traveled](https://leetcode.com/problems/total-distance-traveled)                                                                                       |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 2733 | [Neither Minimum nor Maximum](https://leetcode.com/problems/neither-minimum-nor-maximum)                                                                               |                                                                                   [![Java](assets/java.png)](src/NeitherMinimumNorMaximum.java)                                                                                                                                               |                                                                                                                                   |
+| 2739 | [Total Distance Traveled](https://leetcode.com/problems/total-distance-traveled)                                                                                       |                                                                                   [![Java](assets/java.png)](src/TotalDistanceTraveled.java)                                                                                                                                               |                                                                                                                                   |
 | 2744 | [Find Maximum Number of String Pairs](https://leetcode.com/problems/find-maximum-number-of-string-pairs)                                                               |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2748 | [Number of Beautiful Pairs](https://leetcode.com/problems/number-of-beautiful-pairs)                                                                                   |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2760 | [Longest Even Odd Subarray With Threshold](https://leetcode.com/problems/longest-even-odd-subarray-with-threshold)                                                     |                                                                                                                                                                                                                                  |                                                                                                                                   |

src/TotalDistanceTraveled.java

@@ -0,0 +1,25 @@
+// https://leetcode.com/problems/total-distance-traveled
+// M = mainTank
+// T: O(M)
+// S: O(1)
+
+public class TotalDistanceTraveled {
+    public int distanceTraveled(int mainTank, int additionalTank) {
+        int totalDistance = 0;
+        while (mainTank > 0) {
+            if (mainTank >= 5) {
+                mainTank -= 5;
+                totalDistance += 50;
+                if (additionalTank > 0) {
+                    mainTank++;
+                    additionalTank--;
+                }
+            } else {
+                totalDistance += mainTank * 10;
+                mainTank = 0;
+            }
+        }
+
+        return totalDistance;
+    }
+}