def func(): s = input() s_clock = ''.join(s.split(':')) strr = ''.join(s.split(':'))*4 res = [] all_li = itertools.permutations(strr, 4) for i in all_li: if 0 <= int(i[0]+i[1]) <= 24 and 0 <= int(i[2]+i[3]) <= 59: clock = i[0]+i[1]+i[2]+i[3] res.append(clock) max_res = [m for m in res if m > s_clock] if max_res: ans = min(max_res) else: ans = min(res) print(ans[:2]+':'+ans[2:]) 用全排列解会不会超时呢