New Problem Solution -"Latest Time by Replacing Hidden Digits"

haoel · haoel · commit eadb14735538 · 2021-03-27T14:56:07.000+08:00
diff --git a/README.md b/README.md
@@ -49,6 +49,7 @@ LeetCode
 |1750|[Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/) | [C++](./algorithms/cpp/minimumLengthOfStringAfterDeletingSimilarEnds/MinimumLengthOfStringAfterDeletingSimilarEnds.cpp)|Medium|
 |1749|[Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/) | [C++](./algorithms/cpp/maximumAbsoluteSumOfAnySubarray/MaximumAbsoluteSumOfAnySubarray.cpp)|Medium|
 |1748|[Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/) | [C++](./algorithms/cpp/sumOfUniqueElements/SumOfUniqueElements.cpp)|Easy|
+|1736|[Latest Time by Replacing Hidden Digits](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/) | [C++](./algorithms/cpp/latestTimeByReplacingHiddenDigits/LatestTimeByReplacingHiddenDigits.cpp)|Easy|
 |1734|[Decode XORed Permutation](https://leetcode.com/problems/decode-xored-permutation/) | [C++](./algorithms/cpp/decodeXORedPermutation/DecodeXoredPermutation.cpp)|Medium|
 |1733|[Minimum Number of People to Teach](https://leetcode.com/problems/minimum-number-of-people-to-teach/) | [C++](./algorithms/cpp/minimumNumberOfPeopleToTeach/MinimumNumberOfPeopleToTeach.cpp)|Medium|
 |1732|[Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/) | [C++](./algorithms/cpp/findTheHighestAltitude/FindTheHighestAltitude.cpp)|Easy|
diff --git a/algorithms/cpp/latestTimeByReplacingHiddenDigits/LatestTimeByReplacingHiddenDigits.cpp b/algorithms/cpp/latestTimeByReplacingHiddenDigits/LatestTimeByReplacingHiddenDigits.cpp
@@ -0,0 +1,51 @@
+// Source : https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/
+// Author : Hao Chen
+// Date   : 2021-03-27
+
+/***************************************************************************************************** 
+ *
+ * You are given a string time in the form of  hh:mm, where some of the digits in the string are 
+ * hidden (represented by ?).
+ * 
+ * The valid times are those inclusively between 00:00 and 23:59.
+ * 
+ * Return the latest valid time you can get from time by replacing the hidden digits.
+ * 
+ * Example 1:
+ * 
+ * Input: time = "2?:?0"
+ * Output: "23:50"
+ * Explanation: The latest hour beginning with the digit '2' is 23 and the latest minute ending with 
+ * the digit '0' is 50.
+ * 
+ * Example 2:
+ * 
+ * Input: time = "0?:3?"
+ * Output: "09:39"
+ * 
+ * Example 3:
+ * 
+ * Input: time = "1?:22"
+ * Output: "19:22"
+ * 
+ * Constraints:
+ * 
+ * 	time is in the format hh:mm.
+ * 	It is guaranteed that you can produce a valid time from the given string.
+ ******************************************************************************************************/
+
+class Solution {
+public:
+    string maximumTime(string time) {
+        
+        if (time[0] == '?' ) {
+            time[0] = (time[1] == '?' || time[1] < '4') ?  '2' : '1';
+        }
+        if (time[1] == '?' ) {
+            time[1] = ( time[0] == '2' ) ? '3' : '9';
+        }
+        if (time[3] == '?') time[3] = '5';
+        if (time[4] == '?') time[4] = '9'; 
+        return time;
+    }
+};
