blocks|key|855496|text|Python+3，91字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|855497|def+f(n):
+for+k+in+range(86400):t=k//3600,k//60%2560,k%2560;sum(t)==n!=print('%25d:%2502d:%2502d'%25t)|code-block|syntax|javascript|855498|使用exec+(Python2)或递归(Python3)有较短的解决方案，但两者都需要不合理的内存量。|unstyled|style|CODE|855499|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/nexus/python3#JcZBCoAgEEDRfaeYFtIMBA4VEoaHCdSIaAqz85vQ5v1ffIgQUcg2EK8EB@wCaZUt4GwmZrLZHVqPhrmvNaxMncryvCdmck5ad6ddMnbKW8XDT6cylYgTlQ8^0|0|8|0|0|0|2|4|0|0|6|1^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@$A|14|B|15|L|M]]|9|@]|C|$]]|$1|N|3|O|5|K|7|16|8|@]|9|@$A|17|B|18|1|19]]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://docs.python.org/3/" rel="nofollow noreferrer">Python 3</a>, 91 bytes</h1>

<pre class="lang-python prettyprint-override"><code>def f(n):
 for k in range(86400):t=k//3600,k//60%60,k%60;sum(t)==n!=print('%d:%02d:%02d'%t)
</code></pre>

<p>There are shorter solutions using <code>exec</code> (Python 2) or recursion (Python 3), but both require an unreasonable amount of memory.</p>

<p><a href="https://tio.run/nexus/python3#JcZBCoAgEEDRfaeYFtIMBA4VEoaHCdSIaAqz85vQ5v1ffIgQUcg2EK8EB@wCaZUt4GwmZrLZHVqPhrmvNaxMncryvCdmck5ad6ddMnbKW8XDT6cylYgTlQ8" rel="nofollow noreferrer" title="Python 3 – TIO Nexus">Try it online!</a></p>


blocks|key|855327|text|Haskell，77字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|855328|f+x=[tail$(':':).tail.show.(%2B100)=<<t%7Ct<-mapM(\x->[0..x])[23,59,59],sum+t==x]|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h2>Haskell, 77 bytes</h2>

<pre class="lang-haskell prettyprint-override"><code>f x=[tail$(':':).tail.show.(+100)=&lt;&lt;t|t&lt;-mapM(\x-&gt;[0..x])[23,59,59],sum t==x]
</code></pre>


blocks|key|855306|text|Haskell，90字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|855307|p+x=['0'%7Cx<10]%2B%2Bshow+x
i=[0..59]
f+x=[p+h%2B%2B':':p+m%2B%2B':':p+s%7Ch<-[0..23],m<-i,s<-i,h%2Bm%2Bs==x]|code-block|syntax|javascript|855308|返回HH:MM:SS字符串的列表，例如f+140+->+["22:59:59","23:58:59","23:59:58"]。|unstyled|offset|length|style|CODE|855309|它是三个简单的循环，通过时间，分钟和秒。保存和格式化所有值，其中和是输入数字x。|entityMap^0|0|0|J|5|S|Y|0|12|1^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|R|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|S|8|@$J|T|K|U|L|M]|$J|V|K|W|L|M]]|9|@]|A|$]]|$1|N|3|O|5|I|7|X|8|@$J|Y|K|Z|L|M]]|9|@]|A|$]]]|P|$]]

<h2>Haskell, 90 bytes</h2>

<pre><code>p x=['0'|x&lt;10]++show x
i=[0..59]
f x=[p h++':':p m++':':p s|h&lt;-[0..23],m&lt;-i,s&lt;-i,h+m+s==x]
</code></pre>

<p>Returns a list of HH:MM:SS strings, e.g. <code>f 140</code> -> <code>["22:59:59","23:58:59","23:59:58"]</code>.</p>

<p>It's three simple loops through the hours, minutes and seconds. Keep and format all values where the sum is the input number <code>x</code>.</p>


blocks|key|855437|text|Pyth+-+30字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|855438|所有可能的时间然后过滤。|unstyled|855439|mj\:%25L"%2502d"dfqsTQsM*U24*KU60K|code-block|syntax|javascript|855440|测试套房。|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|http://pyth.herokuapp.com/?code=mj%255C%253A%2525L%2522%252502d%2522dfqsTQsM%252aU24%252aKU60K&test_suite=1&test_suite_input=119%250A141&debug=0^0|0|0|0|0|4|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|W|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|X|8|@]|9|@$L|Y|M|Z|1|10]]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]]]

<h1>Pyth - 30 bytes</h1>
<p>Takes all possible times then filters.</p>
<pre><code>mj\:%L&quot;%02d&quot;dfqsTQsM*U24*KU60K
</code></pre>
<p><a href="http://pyth.herokuapp.com/?code=mj%5C%3A%25L%22%2502d%22dfqsTQsM%2aU24%2aKU60K&amp;test_suite=1&amp;test_suite_input=119%0A141&amp;debug=0" rel="nofollow noreferrer">Test Suite</a>.</p>


blocks|key|855537|text|朱莉娅0.5，69字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|855538|!n=[h%2Bm%2Bs==n&&@printf("%25d:%2502d:%2502d
",h,m,s)for+s=0:59,m=0:59,h=0:23]|code-block|syntax|javascript|855539|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://julialang.org/|1|https://tio.run/nexus/julia5#@6@YZxudoZ2rXWxrm6em5lBQlJlXkqahpJpipWpgBCG4lHQydHJ1ijXT8osUim0NrEwtdXIhVAaQMjKO/a9o8h8A^0|0|6|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="http://julialang.org/" rel="nofollow noreferrer">Julia 0.5</a>, 69 bytes</h1>

<pre class="lang-julia prettyprint-override"><code>!n=[h+m+s==n&amp;&amp;@printf("%d:%02d:%02d
",h,m,s)for s=0:59,m=0:59,h=0:23]
</code></pre>

<p><a href="https://tio.run/nexus/julia5#@6@YZxudoZ2rXWxrm6em5lBQlJlXkqahpJpipWpgBCG4lHQydHJ1ijXT8osUim0NrEwtdXIhVAaQMjKO/a9o8h8A" rel="nofollow noreferrer" title="Julia 0.5 – TIO Nexus">Try it online!</a></p>


blocks|key|855561|text|批处理，168个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|855562|@for+/l+%25%25t+in+(0,1,86399)do+@call:c+%251+%25%25t
@exit/b
:c
@set/ah=%252/3600,m=%252/60%25%2560,s=%252%25%2560,n=%251-h-m-s
@set+m=0%25m%25
@set+s=0%25s%25
@if+%25n%25==0+echo+%25h%25:%25m:~-2%25:%25s:~-2%25|code-block|syntax|javascript|855563|输出一位数小时。|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h2>Batch, 168 bytes</h2>

<pre><code>@for /l %%t in (0,1,86399)do @call:c %1 %%t
@exit/b
:c
@set/ah=%2/3600,m=%2/60%%60,s=%2%%60,n=%1-h-m-s
@set m=0%m%
@set s=0%s%
@if %n%==0 echo %h%:%m:~-2%:%s:~-2%
</code></pre>

<p>Outputs single-digit hours.</p>


blocks|key|855644|text|Mathematica，79字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|855645|Cases[Tuples@{(r=Range)@24-1,x=r@60-1,x},t_/;Tr@t==#:>DateString@TimeObject@t]&|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h2>Mathematica, 79 bytes</h2>

<pre><code>Cases[Tuples@{(r=Range)@24-1,x=r@60-1,x},t_/;Tr@t==#:&gt;DateString@TimeObject@t]&amp;
</code></pre>


blocks|key|6281352|text|球拍39字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6281353|(for*/sum((h+24)(m+60)(s+60))(%2B+h+m+s))|code-block|syntax|javascript|6281354|未高尔夫球：|unstyled|6281355|(for*/sum++++++;+loop+for+all+combinations;+return+sum+of+values+for+each+loop
+++((h+24)+++++;+h+from+0+to+23
++++(m+60)+++++;+m+from+0+to+59
++++(s+60))++++;+s+from+0+to+59
++(%2B+h+m+s))+++;+sum+of+all+3+variables|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|O|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|P|8|@]|9|@]|A|$E|F]]]|L|$]]

<h2>Racket 39 bytes</h2>

<pre><code>(for*/sum((h 24)(m 60)(s 60))(+ h m s))
</code></pre>

<p>Ungolfed: </p>

<pre><code>(for*/sum      ; loop for all combinations; return sum of values for each loop
   ((h 24)     ; h from 0 to 23
    (m 60)     ; m from 0 to 59
    (s 60))    ; s from 0 to 59
  (+ h m s))   ; sum of all 3 variables
</code></pre>


blocks|key|855595|text|马蒂尔，29字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|855596|24:q60:qt&Z*t!si=Y)'%25i:'8:)&V|code-block|syntax|javascript|855597|在网上试试！|unstyled|855598|解释|855599|24:q+++++%25+Push+[0+1+...+23]
60:q+++++%25+Push+[0+1+...+59]
t++++++++%25+Duplicate
&Z*++++++%25+Cartesian+product+of+the+three+arrays.+This+gives+a+matrix+with+each
+++++++++%25+on+a+different+row+Cartesian+tuple
t!+++++++%25+Push+a+transposed+copy
s++++++++%25+Sum+of+each+column
i=+++++++%25+Logical+mask+of+values+that+equal+the+input
Y)+++++++%25+Select+rows+based+on+that+mask
'%25i:'++++%25+Push+this+string
8:)++++++%25+Index+(modularly)+with+[1+2+...+8]:+gives+string+'%25i:%25i:%25i'
&V+++++++%25+Convert+to+string+with+that+format+specification.+Implicitly+display|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/lmendo/MATL|1|https://tio.run/nexus/matl#@29kYlVoZmBVWKIWpVWiWJxpG6mprppppW5hpakW9v@/oaElAA^0|0|3|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/lmendo/MATL" rel="nofollow noreferrer">MATL</a>, 29 bytes</h1>
<pre><code>24:q60:qt&amp;Z*t!si=Y)'%i:'8:)&amp;V
</code></pre>
<p><a href="https://tio.run/nexus/matl#@29kYlVoZmBVWKIWpVWiWJxpG6mprppppW5hpakW9v@/oaElAA" rel="nofollow noreferrer" title="MATL – TIO Nexus">Try it online!</a></p>
<h3>Explanation</h3>
<pre><code>24:q     % Push [0 1 ... 23]
60:q     % Push [0 1 ... 59]
t        % Duplicate
&amp;Z*      % Cartesian product of the three arrays. This gives a matrix with each
         % on a different row Cartesian tuple
t!       % Push a transposed copy
s        % Sum of each column
i=       % Logical mask of values that equal the input
Y)       % Select rows based on that mask
'%i:'    % Push this string
8:)      % Index (modularly) with [1 2 ... 8]: gives string '%i:%i:%i'
&amp;V       % Convert to string with that format specification. Implicitly display
</code></pre>


blocks|key|6281424|text|JavaScript，96字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6281425|v=>{for+(i=86399;i;[a,b,c]=[i/3600%7C0,i%253600/60%7C0,i--%2560]){v-a-b-c?0:console.log(a%2B":"%2Bb%2B":"%2Bc)}}|code-block|syntax|javascript|6281426|扩大视野：|unstyled|6281427|v+=>+{
++++for+(i+=+86399;+i;
++++++++[a,+b,+c]+=+[i+/+3600+%7C+0,+i+%25+3600+/+60+%7C+0,+i--+%25+60])+{
++++++++v+-+a+-+b+-+c+?+0+:+console.log(a+%2B+":"+%2B+b+%2B+":"+%2B+c)
++++}
}|6281428|通过循环86399到1来循环所有可能的时间，|6281429|将整数转换为时间，除以3600，得到第一个数字。|unordered-list-item|6281430|第二个数字，取整数mod+3600，再除以60。|6281431|最后一个数字是整数mod+60。|6281432|从输入值中减去所有3个数字，如果三个数字加到输入值，则返回falsey值。如果值为falsey，则输出该值。|entityMap^0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|X|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Y|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Z|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|10|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|11|8|@]|9|@]|A|$]]|$1|N|3|O|5|P|7|12|8|@]|9|@]|A|$]]|$1|Q|3|R|5|P|7|13|8|@]|9|@]|A|$]]|$1|S|3|T|5|P|7|14|8|@]|9|@]|A|$]]|$1|U|3|V|5|I|7|15|8|@]|9|@]|A|$]]]|W|$]]

<h1>JavaScript, 96 bytes</h1>
<pre><code>v=&gt;{for (i=86399;i;[a,b,c]=[i/3600|0,i%3600/60|0,i--%60]){v-a-b-c?0:console.log(a+&quot;:&quot;+b+&quot;:&quot;+c)}}
</code></pre>
<p>Expanded view:</p>
<pre><code>v =&gt; {
    for (i = 86399; i;
        [a, b, c] = [i / 3600 | 0, i % 3600 / 60 | 0, i-- % 60]) {
        v - a - b - c ? 0 : console.log(a + &quot;:&quot; + b + &quot;:&quot; + c)
    }
}
</code></pre>
<p>Loop through all possible times by looping 86399 to 1,</p>
<ul>
<li>convert the integer to time by dividing by 3600 to get the first
digit</li>
<li>the 2nd digit by taking the integer mod 3600 and then dividing
by 60</li>
<li>and the last digit is the integer mod 60</li>
</ul>
<p>Subtract all 3 numbers from the input value to return a falsey value if the three numbers add up to the input value.  If the value is falsey, output the value.</p>


<p>Given an integer between 0 and 141 (inclusive), list all 24-hour times whose hour, minute, and second units add to that integer.</p>

<p><strong>Rules of addition</strong></p>

<p>Numbers are added by their time units, not by single digits. </p>

<p>For example, take 17:43:59</p>

<p>17+43+59=119</p>

<p>Remember, that is an example of digits being <em>added.</em> In reality, you would enter 119, and 17:43:59 would be one of the results. Output should be given as HH:MM:SS or H:MM:SS.</p>

<p>Also keep in mind the highest number possible is 141, being 23:59:59. This is code golf, so the lowest amount wins. Trial and error is permitted, but there may be a better way to go about this.</p>

<p>Edit: Please specify where in your code the input value is.</p>


Sums of 24-hour time

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

给定一个介于0到141 (包括在内)之间的整数，列出其小时、分钟和秒单位加到该整数中的所有24小时时间。加法规则数字是按时间单位加起来的，而不是用个位数加起来的。例如，17:43:59。17+43+59=119记住，这是一个数字被添加的例子。在现实中，你将进入119，17:43:59将是结果之一。输出应为HH:MM:SS或H:MM:SS。也要记住，最高的数字是141，是23:59:59。这是密码高

问24小时合计时间
EN

加法规则

回答 10

Code Golf用户

Python 3，91字节

Code Golf用户

Haskell，77字节

Code Golf用户

Haskell，90字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问24小时合计时间EN

加法规则

回答 10

Code Golf用户

Python 3，91字节

Code Golf用户

Haskell，77字节

Code Golf用户

Haskell，90字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问24小时合计时间
EN