本文主要是介绍#力扣 LeetCode1736. 替换隐藏数字得到的最晚时间 @FDDLC,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
题目描述:
https://leetcode-cn.com/problems/latest-time-by-replacing-hidden-digits/
自测用例:
"2?:?0"
"0?:3?"
"1?:22"
"??:??"
"??:1?"
"??:?1"
"?2:??"
"1?:??"
"2?:??"
"0?:??"
Java代码:
class Solution {public String maximumTime(String time) {//'?'>'9'char[] a=time.toCharArray();if(a[0]=='?')a[0]=a[1]>='4'&&a[1]<='9'?'1':'2';if(a[1]=='?')a[1]=a[0]<='1'?'9':'3';if(a[3]=='?')a[3]='5';if(a[4]=='?')a[4]='9';return String.valueOf(a);}
}
这篇关于#力扣 LeetCode1736. 替换隐藏数字得到的最晚时间 @FDDLC的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!