华为OD机试 - 机器人搬砖（Java & JS & Python & C & C++）

weixin_43354145: [code=python] def dfs(nums: list, result: list, path: list): if len(path) == 4: hour = "".join(path[0:0 + 2]) mintue = "".join(path[2:2 + 2]) if 0 <= int(hour) <= 23 and 0 <= int(mintue) <= 59 and (hour, mintue) not in result: result.append((hour, mintue)) return for i in range(0, len(nums)): path.append(nums[i]) dfs(nums, result, path) path.pop() def getresult(): line = input() target = (line.split(":")[0], line.split(":")[1]) digits = [_ for _ in line if _.isdigit()] res = [] dfs(digits, res, []) res.sort(key=lambda x: (x[0], x[1])) # print(res) l = len(res) - 1 for i, r in enumerate(res): if r == target: if i != l: return res[i + 1][0] + ":" + res[i + 1][1] else: return res[0][0] + ":" + res[0][1] if __name__ == "__main__": print(getresult()) [/code]