回答此问题可获得 20 贡献值,回答如果被采纳可获得 50 分。
<p>给定一个整数输入。有没有办法用给定的整数来检查日期时间是否可能。我想生成所有这样的日期并返回最大的一个。我写的代码包含了太多的if-else情况,并且是唯一有效的时间约束。在</p>
<pre><code>import random
sortime = []
hr1 = []
hr2 = []
min1 = []
min2 = []
sec1 = []
sec2 = []
index1 = 0
index2 = 0
index3 = 0
index4 = 0
index5 = 0
index6 = 0
ztn = [0,1,2,3,4,5,6,7,8,9]
anysix = [random.randint(0,9) for x in range(6)]
print(anysix)
def index_clk(any_six, index_pos, index, timelist, y):
global index1
for x in any_six:
if x <= y:
index_pos.append(x)
if index_pos == []:
print("no clock time possible")
index = max(index_pos)
index1 = index
timelist.append(index)
print(timelist)
any_six.remove(index)
print(any_six)
index = index1
print(index_clk(any_six = anysix, index_pos = hr1, index = index1, timelist = sortime, y = 2))
##print(index1)
if index1<2:
print(index_clk(any_six = anysix, index_pos = hr2, index = index2, timelist = sortime, y = 9))
else:
print(index_clk(any_six = anysix, index_pos = hr2, index = index2, timelist = sortime, y = 3))
sortime.append(":")
print(index_clk(any_six = anysix, index_pos = min1, index = index3, timelist = sortime, y = 5))
print(index_clk(any_six = anysix, index_pos = min2, index = index4, timelist = sortime, y = 9))
sortime.append(":")
print(index_clk(any_six = anysix, index_pos = sec1, index = index5, timelist = sortime, y = 5))
print(index_clk(any_six = anysix, index_pos = sec2, index = index6, timelist = sortime, y = 9))
for i in sortime:
print(i, end = "")
</code></pre>
<p>我可以使用上面的if-else实现DD-MM HH:MM格式。出于好奇,如果可以使用一些datetime对象和python中的格式来简化代码来实现上述功能。在</p>