leetcode-题库-算法-1736. 替换隐藏数字得到的最晚时间

package com.example.demo;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    public static String maximumTime(String time) {
        char[] chs = time.toCharArray();
        if(chs[0]=='?'){
            if(chs[1]=='?'){
                chs[0]='2';
                chs[1]='3';
            }else if(chs[1]<='3'){
                chs[0]='2';
            }else{
                chs[0]='1';
            }
        }
        if(chs[1]=='?'){
            if(chs[0]=='2')
                chs[1]='3';
            else
                chs[1]='9';
        }
        if(chs[3]=='?'){
            if(chs[4]=='?'){
                chs[3]='5';
                chs[4]='9';
            }else{
                chs[3]='5';
            }
        }
        if(chs[4]=='?'){
            chs[4]='9';
        }
        return new String(chs);
    }
    public static void main(String[] args) throws IOException {
        Scanner scanner = new Scanner(System.in);
        String next = scanner.next();
        String s = maximumTime(next);
        System.out.println(s);
    }
}