blocks|key|772641|text|05AB1E，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|772642|输入是大写的。|unstyled|772643|码|772644|1ì36ö>36B¦|code-block|syntax|javascript|772645|解释|772646|1ì+++++++++++#+Prepend+a+1+to+the+number
++36ö++++++++#+Convert+from+base+36+to+decimal
+++++>+++++++#+Increment+by+1
++++++36B++++#+Convert+from+decimal+to+base+36
+++++++++¦+++#+Remove+the+first+character|772647|使用05AB1E编码。在网上试试！或验证所有测试用例.|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://tio.run/##MzBNTDJM/f/f8PAaY7PD2@yMzZwOLQNyjYxNTM2igAAA|2|https://tio.run/##MzBNTDJM/V9TVvnf8PAaY7PD2@yMzZwOLftfqXR4v8KjtkkKh/cr6fw3gAMuOMsSwYziMjQyNjE1iwICoKizv4uru7@PGwA^0|0|6|0|0|0|0|0|0|0|B|6|1|I|8|2^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]]|C|$]]|$1|D|3|E|5|F|7|18|8|@]|9|@]|C|$]]|$1|G|3|H|5|6|7|19|8|@]|9|@]|C|$]]|$1|I|3|J|5|K|7|1A|8|@]|9|@]|C|$L|M]]|$1|N|3|O|5|6|7|1B|8|@]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1C|8|@]|9|@]|C|$L|M]]|$1|R|3|S|5|F|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]|$A|1H|B|1I|1|1J]]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]|12|$5|V|W|X|C|$Y|13]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E" rel="noreferrer">05AB1E</a>, 10 bytes</h1>

<p>Input is in <strong>uppercase</strong>. </p>

<h3>Code</h3>

<pre><code>1ì36ö&gt;36B¦
</code></pre>

<h3>Explanation</h3>

<pre><code>1ì           # Prepend a 1 to the number
  36ö        # Convert from base 36 to decimal
     &gt;       # Increment by 1
      36B    # Convert from decimal to base 36
         ¦   # Remove the first character
</code></pre>

<p>Uses the <strong>05AB1E</strong> encoding. <a href="https://tio.run/##MzBNTDJM/f/f8PAaY7PD2@yMzZwOLQNyjYxNTM2igAAA" rel="noreferrer" title="05AB1E – Try It Online">Try it online!</a> or <a href="https://tio.run/##MzBNTDJM/V9TVvnf8PAaY7PD2@yMzZwOLftfqXR4v8KjtkkKh/cr6fw3gAMuOMsSwYziMjQyNjE1iwICoKizv4uru7@PGwA" rel="noreferrer">Verify all test cases</a>.</p>


blocks|key|776460|text|杰夫特，13字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|776461|n36+Ä+s36+ù0A|code-block|syntax|javascript|776462|在网上试试！和验证测试用例|unstyled|776463|将输入作为字符串|776464|解释|776465|n36++++++++++++converts+input+to+base+36
++++Ä+++++++++++%2B1
++++++s36+++++++to+base+36+string
++++++++++ù0A+++left-pad+with+0+to+length+10|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ETHproductions/japt|1|https://tio.run/##y0osKPn/P8/YTOFwi0IxiNpp4Pj/v5KBQXJ@Smp6fk6aEgA|2|https://tio.run/##y0osKPn//9C6PGMzhcMtCsUgaqeB4///0UoGcKCkw4XgWaLwqkA8QyNjE1OzKiCAyCXnp6Sm5@ekKcUCAA^0|0|3|0|0|0|0|6|1|7|6|2|0|0|0^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]|$1|D|3|E|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|17|8|@]|9|@$A|18|B|19|1|1A]|$A|1B|B|1C|1|1D]]|C|$]]|$1|L|3|M|5|K|7|1E|8|@]|9|@]|C|$]]|$1|N|3|O|5|6|7|1F|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1G|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]|10|$5|T|U|V|C|$W|11]]]]

<h1><a href="https://github.com/ETHproductions/japt" rel="noreferrer">Japt</a>, 13 bytes</h1>

<pre><code>n36 Ä s36 ù0A
</code></pre>

<p><a href="https://tio.run/##y0osKPn/P8/YTOFwi0IxiNpp4Pj/v5KBQXJ@Smp6fk6aEgA" rel="noreferrer" title="Japt – Try It Online">Try it online!</a> and <a href="https://tio.run/##y0osKPn//9C6PGMzhcMtCsUgaqeB4///0UoGcKCkw4XgWaLwqkA8QyNjE1OzKiCAyCXnp6Sm5@ekKcUCAA" rel="noreferrer" title="Japt – Try It Online">Verify test cases</a></p>

<p>Takes input as a string</p>

<h2>Explanation</h2>

<pre><code>n36            converts input to base 36
    Ä           +1
      s36       to base 36 string
          ù0A   left-pad with 0 to length 10
</code></pre>


blocks|key|772743|text|斯塔克斯，7+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|772744|ûæ≥╡►N▀|code-block|syntax|javascript|772745|运行并调试它|unstyled|772746|解释：|772747|%7C3%5E%7C3A%7Cz+Full+program,+implicit+input
%7C3+++++++Convert+from+base+36
++%5E++++++Increment
+++%7C3++++Convert+to+base+36
+++++A%7Cz+Fill+with+"0"+to+length+10
+++++++++Implicit+output|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/tomtheisen/stax|1|https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax|2|https://staxlang.xyz/#p=9691f2b5104edf&i=%25220000000000%2522%2B%250A%25220000000009%2522%2B%250A%2522000000000z%2522%2B%250A%2522123456zzzz%2522%2B%250A%252200codegolf%2522%2B&a=1&m=2^0|0|4|0|7|3|1|0|0|0|6|2|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]|$A|14|B|15|1|16]]|C|$]]|$1|D|3|E|5|F|7|17|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|18|8|@]|9|@$A|19|B|1A|1|1B]]|C|$]]|$1|L|3|M|5|K|7|1C|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1D|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]|Y|$5|R|S|T|C|$U|Z]]]]

<h1><a href="https://github.com/tomtheisen/stax" rel="noreferrer">Stax</a>, 7 <a href="https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax" rel="noreferrer">bytes</a></h1>

<pre><code>ûæ≥╡►N▀
</code></pre>

<p><a href="https://staxlang.xyz/#p=9691f2b5104edf&amp;i=%220000000000%22+%0A%220000000009%22+%0A%22000000000z%22+%0A%22123456zzzz%22+%0A%2200codegolf%22+&amp;a=1&amp;m=2" rel="noreferrer">Run and debug it</a></p>

<p>Explanation:</p>

<pre><code>|3^|3A|z Full program, implicit input
|3       Convert from base 36
  ^      Increment
   |3    Convert to base 36
     A|z Fill with "0" to length 10
         Implicit output
</code></pre>


blocks|key|776673|text|在线图灵机模拟器，745字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|776674|init:0
accept:2
0,0
0,0,>
0,1
0,1,>
0,2
0,2,>
0,3
0,3,>
0,4
0,4,>
0,5
0,5,>
0,6
0,6,>
0,7
0,7,>
0,8
0,8,>
0,9
0,9,>
0,a
0,a,>
0,b
0,b,>
0,c
0,c,>
0,d
0,d,>
0,e
0,e,>
0,f
0,f,>
0,g
0,g,>
0,h
0,h,>
0,i
0,i,>
0,j
0,j,>
0,k
0,k,>
0,l
0,l,>
0,m
0,m,>
0,n
0,n,>
0,o
0,o,>
0,p
0,p,>
0,q
0,q,>
0,r
0,r,>
0,s
0,s,>
0,t
0,t,>
0,u
0,u,>
0,v
0,v,>
0,w
0,w,>
0,x
0,x,>
0,y
0,y,>
0,z
0,z,>
0,_
1,_,<
1,0
2,1,-
1,1
2,2,-
1,2
2,3,-
1,3
2,4,-
1,4
2,5,-
1,5
2,6,-
1,6
2,7,-
1,7
2,8,-
1,8
2,9,-
1,9
2,a,-
1,a
2,b,-
1,b
2,c,-
1,c
2,d,-
1,d
2,e,-
1,e
2,f,-
1,f
2,g,-
1,g
2,h,-
1,h
2,i,-
1,i
2,j,-
1,j
2,k,-
1,k
2,l,-
1,l
2,m,-
1,m
2,n,-
1,n
2,o,-
1,o
2,p,-
1,p
2,q,-
1,q
2,r,-
1,r
2,s,-
1,s
2,t,-
1,t
2,u,-
1,u
2,v,-
1,v
2,w,-
1,w
2,x,-
1,x
2,y,-
1,y
2,z,-
1,z
1,0,<|code-block|syntax|javascript|776675|在线翻译|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://turingmachinesimulator.com/|1|http://turingmachinesimulator.com/shared/dymdlyvxoj^0|0|8|0|0|0|0|4|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="https://turingmachinesimulator.com/" rel="noreferrer">Online Turing Machine Simulator</a>, 745 bytes</h1>

<pre><code>init:0
accept:2
0,0
0,0,&gt;
0,1
0,1,&gt;
0,2
0,2,&gt;
0,3
0,3,&gt;
0,4
0,4,&gt;
0,5
0,5,&gt;
0,6
0,6,&gt;
0,7
0,7,&gt;
0,8
0,8,&gt;
0,9
0,9,&gt;
0,a
0,a,&gt;
0,b
0,b,&gt;
0,c
0,c,&gt;
0,d
0,d,&gt;
0,e
0,e,&gt;
0,f
0,f,&gt;
0,g
0,g,&gt;
0,h
0,h,&gt;
0,i
0,i,&gt;
0,j
0,j,&gt;
0,k
0,k,&gt;
0,l
0,l,&gt;
0,m
0,m,&gt;
0,n
0,n,&gt;
0,o
0,o,&gt;
0,p
0,p,&gt;
0,q
0,q,&gt;
0,r
0,r,&gt;
0,s
0,s,&gt;
0,t
0,t,&gt;
0,u
0,u,&gt;
0,v
0,v,&gt;
0,w
0,w,&gt;
0,x
0,x,&gt;
0,y
0,y,&gt;
0,z
0,z,&gt;
0,_
1,_,&lt;
1,0
2,1,-
1,1
2,2,-
1,2
2,3,-
1,3
2,4,-
1,4
2,5,-
1,5
2,6,-
1,6
2,7,-
1,7
2,8,-
1,8
2,9,-
1,9
2,a,-
1,a
2,b,-
1,b
2,c,-
1,c
2,d,-
1,d
2,e,-
1,e
2,f,-
1,f
2,g,-
1,g
2,h,-
1,h
2,i,-
1,i
2,j,-
1,j
2,k,-
1,k
2,l,-
1,l
2,m,-
1,m
2,n,-
1,n
2,o,-
1,o
2,p,-
1,p
2,q,-
1,q
2,r,-
1,r
2,s,-
1,s
2,t,-
1,t
2,u,-
1,u
2,v,-
1,v
2,w,-
1,w
2,x,-
1,x
2,y,-
1,y
2,z,-
1,z
1,0,&lt;
</code></pre>

<p><a href="http://turingmachinesimulator.com/shared/dymdlyvxoj" rel="noreferrer">Online interpreter</a></p>


blocks|key|772687|text|马蒂尔，12字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|772688|36ZAQ5M10&YA|code-block|syntax|javascript|772689|在网上试试！|unstyled|772690|+++++++++++%25+Implicit+input
36ZA+++++++%25+convert+from+base+36+to+decimal
Q++++++++++%25+increment+by+1
5M+++++++++%25+bring+the+36+back+on+stack+(done+this+way+to+avoid+needing+space+separator+after+this)
10+++++++++%25+=+minimum+length+of+output+string
&YA++++++++%25+convert+back+to+base+36+with+those+arguments
+++++++++++%25+Implicit+output|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/lmendo/MATL|1|https://tio.run/##y00syfmf8N/YLMox0NTX0EAt0vG/S8h/dYPk/JTU9PyctCp1LnUDOEDmWCJzQMoMjYxNTM2qgAAsAzNBHQA^0|0|3|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|F|7|15|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://github.com/lmendo/MATL" rel="nofollow noreferrer">MATL</a>, 12 bytes</h1>

<pre><code>36ZAQ5M10&amp;YA
</code></pre>

<p><a href="https://tio.run/##y00syfmf8N/YLMox0NTX0EAt0vG/S8h/dYPk/JTU9PyctCp1LnUDOEDmWCJzQMoMjYxNTM2qgAAsAzNBHQA" rel="nofollow noreferrer" title="MATL – Try It Online">Try it online!</a></p>

<pre><code>           % Implicit input
36ZA       % convert from base 36 to decimal
Q          % increment by 1
5M         % bring the 36 back on stack (done this way to avoid needing space separator after this)
10         % = minimum length of output string
&amp;YA        % convert back to base 36 with those arguments
           % Implicit output
</code></pre>


blocks|key|776995|text|哈斯克尔，63字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|776996|r.f.r
f('9':r)='a':r
f('z':r)='0':f+r
f(c:r)=succ+c:r
r=reverse|code-block|syntax|javascript|776997|在网上试试！反转字符串并检查第一个字符：|unstyled|776998|9被a所取代。|unordered-list-item|style|CODE|776999|将z替换为0，然后递归地检查下一个字符。|777000|所有其他字符都使用succ递增，因为它们是Enum类的一个实例，因此可以在字符上使用这个后续函数。|777001|最后，结果字符串将再次反转。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.haskell.org/|1|https://tio.run/##y0gszk7NyfmfrmCrEPO/SC9Nr4grTUPdUt2qSNNWPRFIgbhVEK6BulWaAkggGcQtLk1OVgCyuIpsi1LLUouKU//nJmbmAQ3KTSzwVdAoKC0JLinyyVPQU0jXVIhWMoADJR0ExxKZUwXkGBoZm5iaVQEBWCY5PyU1PT8nTSn2/7/ktJzE9OL/uhHOAQEA|2|http://hackage.haskell.org/package/base-4.11.1.0/docs/Prelude.html#t:Enum^0|0|4|0|0|0|0|6|1|0|0|1|2|1|0|1|1|5|1|0|9|4|L|5|2|0^^$0|@$1|2|3|4|5|6|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|D|3|E|5|F|7|1B|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1C|8|@]|9|@$A|1D|B|1E|1|1F]]|C|$]]|$1|L|3|M|5|N|7|1G|8|@$A|1H|B|1I|O|P]|$A|1J|B|1K|O|P]]|9|@]|C|$]]|$1|Q|3|R|5|N|7|1L|8|@$A|1M|B|1N|O|P]|$A|1O|B|1P|O|P]]|9|@]|C|$]]|$1|S|3|T|5|N|7|1Q|8|@$A|1R|B|1S|O|P]]|9|@$A|1T|B|1U|1|1V]]|C|$]]|$1|U|3|V|5|K|7|1W|8|@]|9|@]|C|$]]]|W|$X|$5|Y|Z|10|C|$11|12]]|13|$5|Y|Z|10|C|$11|14]]|15|$5|Y|Z|10|C|$11|16]]]]

<h1><a href="https://www.haskell.org/" rel="nofollow noreferrer">Haskell</a>, 63 bytes</h1>



<pre class="lang-hs prettyprint-override"><code>r.f.r
f('9':r)='a':r
f('z':r)='0':f r
f(c:r)=succ c:r
r=reverse
</code></pre>

<p><a href="https://tio.run/##y0gszk7NyfmfrmCrEPO/SC9Nr4grTUPdUt2qSNNWPRFIgbhVEK6BulWaAkggGcQtLk1OVgCyuIpsi1LLUouKU//nJmbmAQ3KTSzwVdAoKC0JLinyyVPQU0jXVIhWMoADJR0ExxKZUwXkGBoZm5iaVQEBWCY5PyU1PT8nTSn2/7/ktJzE9OL/uhHOAQEA" rel="nofollow noreferrer" title="Haskell – Try It Online">Try it online!</a> Reverses the string and checks the first character:</p>

<ul>
<li>A <code>9</code> is replaced by an <code>a</code>.</li>
<li>A <code>z</code> is replaced by a <code>0</code> and recursively the next character is checked.</li>
<li>All other characters are incremented using <code>succ</code>, the successor function which can be used on Chars because they are an instance of the <a href="http://hackage.haskell.org/package/base-4.11.1.0/docs/Prelude.html#t:Enum" rel="nofollow noreferrer">Enum class</a>.</li>
</ul>

<p>Finally the resulting string is reversed again.</p>


blocks|key|772902|text|木炭，14字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|772903|×0⁹←⮌⍘⊕⍘Ｓ³⁶¦³⁶|code-block|syntax|javascript|772904|在网上试试！链接是详细的代码版本。解释：|unstyled|772905|×0⁹|772906|打印9+0s。这是用来填充结果的。|style|CODE|772907|←⮌⍘⊕⍘Ｓ³⁶¦³⁶|772908|将输入从基数36转换为增量，然后再转换回基36。然后，反转结果并向左打印。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/somebody1234/Charcoal|1|https://tio.run/##S85ILErOT8z5/z@gKDOvRCMkMze1WEPJQElHwVJT05oLImrlk5pWoqMQlFqWWlScquGUWJwaXAKUSdfwzEsuSs1NzStJTUEVLigtgbI1dRSMzTShpKb1//8GBsn5Kanp@Tlp/3XLcgA^0|0|2|0|0|0|0|6|1|0|0|4|1|0|0^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]]|C|$]]|$1|D|3|E|5|F|7|18|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|19|8|@]|9|@$A|1A|B|1B|1|1C]]|C|$]]|$1|L|3|M|5|F|7|1D|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|1E|8|@$A|1F|B|1G|P|Q]]|9|@]|C|$]]|$1|R|3|S|5|F|7|1H|8|@]|9|@]|C|$G|H]]|$1|T|3|U|5|K|7|1I|8|@]|9|@]|C|$]]]|V|$W|$5|X|Y|Z|C|$10|11]]|12|$5|X|Y|Z|C|$10|13]]]]

<h1><a href="https://github.com/somebody1234/Charcoal" rel="nofollow noreferrer">Charcoal</a>, 14 bytes</h1>

<pre><code>×0⁹←⮌⍘⊕⍘Ｓ³⁶¦³⁶
</code></pre>

<p><a href="https://tio.run/##S85ILErOT8z5/z@gKDOvRCMkMze1WEPJQElHwVJT05oLImrlk5pWoqMQlFqWWlScquGUWJwaXAKUSdfwzEsuSs1NzStJTUEVLigtgbI1dRSMzTShpKb1//8GBsn5Kanp@Tlp/3XLcgA" rel="nofollow noreferrer" title="Charcoal – Try It Online">Try it online!</a> Link is to verbose version of code. Explanation:</p>

<pre><code>×0⁹
</code></pre>

<p>Print 9 <code>0</code>s. This serves to pad the result.</p>

<pre><code>←⮌⍘⊕⍘Ｓ³⁶¦³⁶
</code></pre>

<p>Convert the input from base 36, incremented it, then convert back to base 36. Then, reverse the result and print it leftwards.</p>


blocks|key|776885|text|JavaScript+(ES6)，89字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|776886|这一项的字节效率不如另一个JavaScript条目，但我在没有注意到这条规则的情况下做出了这样的决定：|unstyled|offset|length|776887|给定长度为10的字符串|blockquote|776888|所以这不是一个严肃的入口-只是为了好玩！它使用一般长度的字符串(如0abc+)，并在第一个数字为z+(例如zzz+->+1000+)时为1加前面。输入必须是小写。|style|CODE|776889|s=>(l=s[s.length-1],r=s.slice(0,-1),l=='z'?f(r%7C%7C'0')%2B0:r%2B(parseInt(l,36)%2B1).toString(36))|code-block|syntax|javascript|776890|解释|776891|表达式(A,+B,+C)实际上意味着"do，然后做B，然后返回C"，我使用这个表达式声明了代码中重用的一些变量。s代表“字符串”，l表示“最后”，r表示"rest“。|776892|/*1*/+s=>(
/*2*/+++l=s[s.length-1],
/*3*/+++r=s.slice(0,-1),
/*4*/+++l=='z'
/*5*/+++++?+f(r%7C%7C'0')%2B0
/*6*/+++++:+r%2B(parseInt(l,36)%2B1).toString(36))|776893|这是一个递归函数。对于aza这样的典型字符串，它只会增加最后一个字符(参见第6行)-+azb。但是对于以z结尾的字符串(如h0gz+)，它将在所有东西上运行到最后一个字符(+z)，并替换一个0+(参见第5行)-+f(h0gz)+=+f(h0g)+%2B+0+=+h0h0。|776894|第5行中的%7C%7C'0'使函数在1长度字符串(即字符串'z')上被调用时工作。没有它，就会调用f('')+(因为'z'.slice(0,+-1)是'')，它具有未定义的行为(字面意思是--自己尝试)，这是没有好处的。f('z')的预期结果是'10'，这就是我们从f('0')+%2B+0获得的结果，所以我们使用%7C%7C'0'。(%7C%7C'0'特别有用，因为它不妨碍通常的情况-+r至少1长(s至少2长)，因为字符串只有在0长度时才是假的。)|776895|递增字符串的方法与其他JS条目中使用的方法相同:将基-36+"+number“转换为实际数字，添加1，然后将其转换回基-36。我们不需要担心1从增加'z‘('z'+->+'10')，因为我们从来没有实际增加'z’(参见第4和第6行:最后一个字符只有当它不是‘z’时才会增加)。|776896|此外，我们从不冒险放弃前导零，因为我们从来没有实际操作超过一个字符在一次-只有在字符串中的最后一个字符。当你分割任何字符串和后置单词时，剩下的字符都会被清晰地分割掉。|entityMap|0|LINK|mutability|MUTABLE|url|https://codegolf.stackexchange.com/a/169453/41061^0|0|A|F|0|0|0|X|4|1C|1|1H|3|1O|4|1W|1|0|0|0|3|9|1K|1|1T|1|21|1|0|0|B|3|17|3|1G|1|1P|4|2F|1|2N|1|2Y|7|38|A|3L|4|0|5|5|P|3|19|5|1I|G|1Z|2|2Y|6|3A|4|3L|A|47|5|4E|5|51|1|57|1|0|1Y|1|26|3|2D|4|0^^$0|@$1|2|3|4|5|6|7|1D|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|1E|8|@]|9|@$E|1F|F|1G|1|1H]]|A|$]]|$1|G|3|H|5|I|7|1I|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|1J|8|@$E|1K|F|1L|L|M]|$E|1M|F|1N|L|M]|$E|1O|F|1P|L|M]|$E|1Q|F|1R|L|M]|$E|1S|F|1T|L|M]]|9|@]|A|$]]|$1|N|3|O|5|P|7|1U|8|@]|9|@]|A|$Q|R]]|$1|S|3|T|5|6|7|1V|8|@]|9|@]|A|$]]|$1|U|3|V|5|D|7|1W|8|@$E|1X|F|1Y|L|M]|$E|1Z|F|20|L|M]|$E|21|F|22|L|M]|$E|23|F|24|L|M]]|9|@]|A|$]]|$1|W|3|X|5|P|7|25|8|@]|9|@]|A|$Q|R]]|$1|Y|3|Z|5|D|7|26|8|@$E|27|F|28|L|M]|$E|29|F|2A|L|M]|$E|2B|F|2C|L|M]|$E|2D|F|2E|L|M]|$E|2F|F|2G|L|M]|$E|2H|F|2I|L|M]|$E|2J|F|2K|L|M]|$E|2L|F|2M|L|M]|$E|2N|F|2O|L|M]]|9|@]|A|$]]|$1|10|3|11|5|D|7|2P|8|@$E|2Q|F|2R|L|M]|$E|2S|F|2T|L|M]|$E|2U|F|2V|L|M]|$E|2W|F|2X|L|M]|$E|2Y|F|2Z|L|M]|$E|30|F|31|L|M]|$E|32|F|33|L|M]|$E|34|F|35|L|M]|$E|36|F|37|L|M]|$E|38|F|39|L|M]|$E|3A|F|3B|L|M]|$E|3C|F|3D|L|M]]|9|@]|A|$]]|$1|12|3|13|5|D|7|3E|8|@$E|3F|F|3G|L|M]|$E|3H|F|3I|L|M]|$E|3J|F|3K|L|M]]|9|@]|A|$]]|$1|14|3|15|5|D|7|3L|8|@]|9|@]|A|$]]]|16|$17|$5|18|19|1A|A|$1B|1C]]]]

<h1>JavaScript (ES6), 89 bytes</h1>

<p>This one is not nearly as byte-efficient as <a href="https://codegolf.stackexchange.com/a/169453/41061">the other JavaScript entry</a>, but I made this without noticing this rule:</p>

<blockquote>
  <p>Given a string <strong>of length 10</strong></p>
</blockquote>

<p>So this isn't a serious entry - just for fun! It works with strings of general length, such as <code>0abc</code>, and prepends a <code>1</code> when the first digit is <code>z</code>, e.g. <code>zzz</code> -> <code>1000</code>. Input must be lowercase.</p>

<pre><code>s=&gt;(l=s[s.length-1],r=s.slice(0,-1),l=='z'?f(r||'0')+0:r+(parseInt(l,36)+1).toString(36))
</code></pre>

<h2>Explanation</h2>

<p>The expression <code>(A, B, C)</code> actually means "do A, then do B, then return C", which I make use of to declare some variables I reuse in the code. <code>s</code> stands for "string", <code>l</code> means "last", <code>r</code> means "rest".</p>

<pre><code>/*1*/ s=&gt;(
/*2*/   l=s[s.length-1],
/*3*/   r=s.slice(0,-1),
/*4*/   l=='z'
/*5*/     ? f(r||'0')+0
/*6*/     : r+(parseInt(l,36)+1).toString(36))
</code></pre>

<p>This is a recursive function. For a typical string like <code>aza</code>, it will just increment the last character (see line 6) - <code>azb</code>. But for a string that ends with <code>z</code>, like <code>h0gz</code>, it will run itself on everything up to the last character (the <code>z</code>) and substitute a <code>0</code> in place of it (see line 5) - <code>f(h0gz)</code> = <code>f(h0g) + 0</code> = <code>h0h0</code>.</p>

<p>The <code>||'0'</code> in line 5 is so that the function works when it's called on a 1-length string (i.e. the string <code>'z'</code>). Without it, <code>f('')</code> is called (since <code>'z'.slice(0, -1)</code> is <code>''</code>), which has undefined behavior (literally - try it yourself), and that's no good. The expected result of <code>f('z')</code> is <code>'10'</code>, which is what we get from <code>f('0') + 0</code>, so we use <code>||'0'</code>. (<code>||'0'</code> is particularly useful because it doesn't get in the way of the <em>usual</em> case - <code>r</code> being at least 1-length (<code>s</code> at least 2-length) - because strings are falsey only when they are 0-length.)</p>

<p>The method for incrementing a string is the same as used in the other JS entry: convert the base-36 "number" into an actual number, add 1, then convert it back to base-36. We don't need to worry about the <code>1</code> from incrementing 'z' (<code>'z'</code> -> <code>'10'</code>), since we never actually increment 'z' (see line 4 and 6: the last character is only incremented if it is not 'z').</p>

<p>Also, we never risk discarding leading zeroes, because we don't ever actually manipulate more than a single character at a time - only ever the last character in the string. The rest of the characters are cleanly sliced off as you slice any string and prepended afterwords.</p>


blocks|key|776934|text|红宝石，40字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|776935|->s{(s.to_i(36)%2B1).to_s(36).rjust+10,?0}|code-block|syntax|javascript|776936|在网上试试！|unstyled|776937|将字符串转换为整数，将其解释为基数36。|ordered-list-item|776938|加1|776939|转换回基36字符串|776940|左垫与0s|style|CODE|776941|"zzzzzzzzzz"返回一个11长的字符串。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.ruby-lang.org/|1|https://tio.run/##KypNqvyfZvtf1664WqNYryQ/PlPD2ExT21ATxC4GsfWKskqLSxQMDXTsDWr/FyikRSsZwIFSrIKtrQJCwFCJC1WFJbqKRHQVVWgqDA2gKgyNjE1MzaqAAKoCLGAOthZmRnJ@Smp6fk4a3AyoQLrSfwA^0|0|3|0|0|0|0|6|1|0|0|0|0|3|1|0|0|C^^$0|@$1|2|3|4|5|6|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|D|3|E|5|F|7|1B|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1C|8|@]|9|@$A|1D|B|1E|1|1F]]|C|$]]|$1|L|3|M|5|N|7|1G|8|@]|9|@]|C|$]]|$1|O|3|P|5|N|7|1H|8|@]|9|@]|C|$]]|$1|Q|3|R|5|N|7|1I|8|@]|9|@]|C|$]]|$1|S|3|T|5|N|7|1J|8|@$A|1K|B|1L|U|V]]|9|@]|C|$]]|$1|W|3|X|5|K|7|1M|8|@$A|1N|B|1O|U|V]]|9|@]|C|$]]]|Y|$Z|$5|10|11|12|C|$13|14]]|15|$5|10|11|12|C|$13|16]]]]

<h1><a href="https://www.ruby-lang.org/" rel="nofollow noreferrer">Ruby</a>, 40 bytes</h1>



<pre class="lang-ruby prettyprint-override"><code>-&gt;s{(s.to_i(36)+1).to_s(36).rjust 10,?0}
</code></pre>

<p><a href="https://tio.run/##KypNqvyfZvtf1664WqNYryQ/PlPD2ExT21ATxC4GsfWKskqLSxQMDXTsDWr/FyikRSsZwIFSrIKtrQJCwFCJC1WFJbqKRHQVVWgqDA2gKgyNjE1MzaqAAKoCLGAOthZmRnJ@Smp6fk4a3AyoQLrSfwA" rel="nofollow noreferrer" title="Ruby – Try It Online">Try it online!</a></p>

<ol>
<li>Convert the string to an integer interpreting it as base 36</li>
<li>Add 1</li>
<li>Convert back to base 36 string</li>
<li>Left pad with <code>0</code>s</li>
</ol>

<p><code>"zzzzzzzzzz"</code> returns an 11-long string</p>


blocks|key|774071|text|脑盘，109个字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|774072|,[>>,]<%2B[%2B%2B%2B%2B<[<--->>-<-]-[<->>%2B<---]<[[-]>-------<]%2B>>[[%2B<%2B>]<<%2B[>%2B<------]>>]-[<%2B>-----]<%2B%2B%2B%2B<]<[<<]>>[.>>]|code-block|syntax|javascript|774073|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/TryItOnline/brainfuck|1|https://tio.run/##JYxLCoBADEMP1KngdxVyEEsXKggiuBA8f@0wb1WavOzvdj3nd9wRxcjiEJMEBlUlFeqaNyn14TBTpzbgQpoJhI4UW6fWyGpJK@ZmXUwXyMS6TCP6YZzmZU1@^0|0|2|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="https://github.com/TryItOnline/brainfuck" rel="nofollow noreferrer">brainfuck</a>, 109 bytes</h1>

<pre><code>,[&gt;&gt;,]&lt;+[++++&lt;[&lt;---&gt;&gt;-&lt;-]-[&lt;-&gt;&gt;+&lt;---]&lt;[[-]&gt;-------&lt;]+&gt;&gt;[[+&lt;+&gt;]&lt;&lt;+[&gt;+&lt;------]&gt;&gt;]-[&lt;+&gt;-----]&lt;++++&lt;]&lt;[&lt;&lt;]&gt;&gt;[.&gt;&gt;]
</code></pre>

<p><a href="https://tio.run/##JYxLCoBADEMP1KngdxVyEEsXKggiuBA8f@0wb1WavOzvdj3nd9wRxcjiEJMEBlUlFeqaNyn14TBTpzbgQpoJhI4UW6fWyGpJK@ZmXUwXyMS6TCP6YZzmZU1@" rel="nofollow noreferrer" title="brainfuck – Try It Online">Try it online!</a></p>


blocks|key|772836|text|Python+2，88字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|772837|def+f(s):L,R=s[:-1],s[-1:];return+s+and[[L%2Bchr(ord(R)%2B1),f(L)%2B'0'][R>'y'],L%2B'a'][R=='9']|code-block|syntax|javascript|772838|在网上试试！|unstyled|772839|增加字符串“手动”。|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/2/|1|https://tio.run/##Vc69CoMwHATwuX2K4PJPSARjP8AUfYJMriGDNKYKJZHEDvryqVJo6W0/joOblnnwrkzJ9BZZHImQrK2jEjnXLKqcC30L/fwKDkXUOaOUpPchYB8MbgnlhFksCYUCtGobWEAzSaHbVddQgU7Wh206OqSy4puMoZ@qP627eHk6X67rlk9396Z/@KfNtDgepjC6GUUGeQNs/5zSGw^0|0|8|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|K|7|15|8|@]|9|@]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

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



<pre class="lang-python prettyprint-override"><code>def f(s):L,R=s[:-1],s[-1:];return s and[[L+chr(ord(R)+1),f(L)+'0'][R&gt;'y'],L+'a'][R=='9']
</code></pre>

<p><a href="https://tio.run/##Vc69CoMwHATwuX2K4PJPSARjP8AUfYJMriGDNKYKJZHEDvryqVJo6W0/joOblnnwrkzJ9BZZHImQrK2jEjnXLKqcC30L/fwKDkXUOaOUpPchYB8MbgnlhFksCYUCtGobWEAzSaHbVddQgU7Wh206OqSy4puMoZ@qP627eHk6X67rlk9396Z/@KfNtDgepjC6GUUGeQNs/5zSGw" rel="nofollow noreferrer" title="Python 2 – Try It Online">Try it online!</a></p>

<p>Increments the string "by hand".</p>


blocks|key|777828|text|星光，325个字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|777829|+++++%2B+,+,+,+,+,+,+,+,+,+,+++++%2B++++++%2B+++%2B+++%2B`*+%2B++++++++++%2B+%2B*+%2B+%2B**++++++%2B+*+%2B*+*+'++++%2B+++++++++++%2B+%2B*+%2B*+%2B*+%2B*++++++%2B*+`+++++%2B++%2B+%2B++++++++++++++++%2B+%2B++*+++++++%2B*+*++'++++%2B++++++%2B*+++++++++++%2B+%2B*+%2B*+%2B*++`+++%2B+++%2B+++++++++++%2B+%2B*+%2B++*++**+++%2B++%2B+%2B'++++%2B++++%2B+++`+%2B+++++++++++%2B+%2B*+%2B++*++++*+.+++++++++++%2B+%2B*+%2B++*+++*+%2B+++'|code-block|syntax|javascript|777830|在网上试试！|unstyled|777831|解释：|777832|Put-a-zero-at-the-base-of-the-stack
%7C+++++%2B
Read-10-digits
%7C+,+,+,+,+,+,+,+,+,+,
Initialise-next-stack
%7C+++++%2B
Initialise-carry-bit
%7C++++++%2B
%7C+++%2B+++%2B
Do
%7C`
++++Top-of-stack:-[output-stack]-[carry-bit]-[next-value]
++++Add-Carry-bit-to-digit
++++%7C*
++++
++++Compare-with-58-("9"=57)
++++%7C+%2B
++++5-double-triple-sub1-double
++++%7C++++++++++%2B+%2B*+%2B+%2B**++++++%2B+*+%2B*
++++Take-difference
++++%7C+*
++++If-one-above-"9"
++++%7C+'
++++++++set-to-"a"=97=6-double-double-double-double-add1
++++++++%7C++++%2B
++++++++%7C+++++++++++%2B+%2B*+%2B*+%2B*+%2B*++++++%2B*
++++%7C+`
++++
++++Initialise-next-carry-bit
++++%7C+++++%2B
++++%7C++%2B
++++
++++Compare-with-123-("z"=122)
++++%7C+%2B
++++11-squared-add2
++++%7C++++++++++++++++%2B+%2B++*+++++++%2B*
++++Take-difference
++++%7C+*
++++If-one-above-"z"
++++%7C++'
++++++++Delete-current-value
++++++++%7C++++%2B
++++++++set-carry-bit
++++++++%7C++++++%2B*
++++++++Set-to-"0"=48
++++++++%7C+++++++++++%2B+%2B*+%2B*+%2B*
++++%7C++`
++++
++++Push-value-to-stack
++++%7C+++%2B+++%2B
++++%7C+++++++++++%2B+%2B*+%2B++*
++++%7C++**
++++
++++%7C+++%2B++%2B
While-next-value-is-not-null
%7C+%2B'

Pop-carry-bit-and-null-string-terminator
%7C++++%2B++++%2B
Do
%7C+++`
++++Get-top-value
++++%7C+%2B
++++%7C+++++++++++%2B+%2B*+%2B++*
++++%7C++++*
++++
++++Print-it
++++%7C+.
++++
++++Pop-the-value-off-the-stack
++++%7C+++++++++++%2B+%2B*+%2B++*
++++%7C+++*
While-stack-is-not-null
%7C+%2B+++'|entityMap|0|LINK|mutability|MUTABLE|url|https://esolangs.org/wiki/Starry|1|https://tio.run/##dZDbDoAgCIZfhTs3aK1HsnW6aXOzbnp6ShhmTT2g/MCH8zjHGC9mSIOgq0yN5EO2R5NUJhSD5mNSEFxRW2TaUgnBG5w@yVYBgJBzn2tJNcqfLkyqdhecPFU7vrhkfKsimb4R0t9wzMMwhXnZwr7e^0|0|2|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://esolangs.org/wiki/Starry" rel="nofollow noreferrer">Starry</a>, 325 bytes</h1>
<pre><code>     + , , , , , , , , , ,     +      +   +   +`* +          + +* + +**      + * +* * '    +           + +* +* +* +*      +* `     +  + +                + +  *       +* *  '    +      +*           + +* +* +*  `   +   +           + +* +  *  **   +  + +'    +    +   ` +           + +* +  *    * .           + +* +  *   * +   '
</code></pre>
<p><a href="https://tio.run/##dZDbDoAgCIZfhTs3aK1HsnW6aXOzbnp6ShhmTT2g/MCH8zjHGC9mSIOgq0yN5EO2R5NUJhSD5mNSEFxRW2TaUgnBG5w@yVYBgJBzn2tJNcqfLkyqdhecPFU7vrhkfKsimb4R0t9wzMMwhXnZwr7e" rel="nofollow noreferrer" title="Starry – Try It Online">Try it online!</a></p>
<h1>Explanation:</h1>
<pre><code>Put-a-zero-at-the-base-of-the-stack
|     +
Read-10-digits
| , , , , , , , , , ,
Initialise-next-stack
|     +
Initialise-carry-bit
|      +
|   +   +
Do
|`
    Top-of-stack:-[output-stack]-[carry-bit]-[next-value]
    Add-Carry-bit-to-digit
    |*
    
    Compare-with-58-(&quot;9&quot;=57)
    | +
    5-double-triple-sub1-double
    |          + +* + +**      + * +*
    Take-difference
    | *
    If-one-above-&quot;9&quot;
    | '
        set-to-&quot;a&quot;=97=6-double-double-double-double-add1
        |    +
        |           + +* +* +* +*      +*
    | `
    
    Initialise-next-carry-bit
    |     +
    |  +
    
    Compare-with-123-(&quot;z&quot;=122)
    | +
    11-squared-add2
    |                + +  *       +*
    Take-difference
    | *
    If-one-above-&quot;z&quot;
    |  '
        Delete-current-value
        |    +
        set-carry-bit
        |      +*
        Set-to-&quot;0&quot;=48
        |           + +* +* +*
    |  `
    
    Push-value-to-stack
    |   +   +
    |           + +* +  *
    |  **
    
    |   +  +
While-next-value-is-not-null
| +'

Pop-carry-bit-and-null-string-terminator
|    +    +
Do
|   `
    Get-top-value
    | +
    |           + +* +  *
    |    *
    
    Print-it
    | .
    
    Pop-the-value-off-the-stack
    |           + +* +  *
    |   *
While-stack-is-not-null
| +   '
</code></pre>


blocks|key|773312|text|Wolfram语言(数学)，39字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|773313|IntegerString[#~FromDigits~36%2B1,36,10]&|code-block|syntax|javascript|773314|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.wolfram.com/wolframscript/|1|https://tio.run/##y00syUjNTSzJTE78n6Zg@98zryQ1PbUouKQoMy89WrnOrSg/1yUzPbOkuM7YTNtQx9hMx9AgVu1/AFC@JFpZQddOIS1aOTZWQU1B30GhWskADpR0FBA8SxReFYhnaGRsYmpWBQQQueT8lNT0/Jw0pdr/AA^0|0|D|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="https://www.wolfram.com/wolframscript/" rel="nofollow noreferrer">Wolfram Language (Mathematica)</a>, 39 bytes</h1>

<pre><code>IntegerString[#~FromDigits~36+1,36,10]&amp;
</code></pre>

<p><a href="https://tio.run/##y00syUjNTSzJTE78n6Zg@98zryQ1PbUouKQoMy89WrnOrSg/1yUzPbOkuM7YTNtQx9hMx9AgVu1/AFC@JFpZQddOIS1aOTZWQU1B30GhWskADpR0FBA8SxReFYhnaGRsYmpWBQQQueT8lNT0/Jw0pdr/AA" rel="nofollow noreferrer" title="Wolfram Language (Mathematica) – Try It Online">Try it online!</a></p>


blocks|key|777106|text|Python+3.6%2B和gmpy2，62字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|777107|from+gmpy2+import*;f=lambda+s:f'{digits(mpz(s,36)%2B1,36):0>10}'|code-block|syntax|javascript|777108|在网上试试！|unstyled|777109|(请注意，gmpy2不是Python库的一部分，需要单独安装)|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##VY3BCsIwEAXP@hVLL2m0QttowYj9EfFQrdsGmmxIcmnFb48tguIcHgxzeHYMPRkRIzrS0Gk7lqC0JRc2JzwPjb61DXiJ7NmqTgWfajulPhMV3xbLyrwu8heLSA48KAOXJP@SZPCz459NixWl2B@qaebT7tQ@Ohowucr1yjplAsxfbFezDFPPeYxv^0|0|H|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|K|7|15|8|@]|9|@]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://docs.python.org/3/" rel="nofollow noreferrer">Python 3.6+ and gmpy2</a>, 62 bytes</h1>



<pre class="lang-python prettyprint-override"><code>from gmpy2 import*;f=lambda s:f'{digits(mpz(s,36)+1,36):0&gt;10}'
</code></pre>

<p><a href="https://tio.run/##VY3BCsIwEAXP@hVLL2m0QttowYj9EfFQrdsGmmxIcmnFb48tguIcHgxzeHYMPRkRIzrS0Gk7lqC0JRc2JzwPjb61DXiJ7NmqTgWfajulPhMV3xbLyrwu8heLSA48KAOXJP@SZPCz459NixWl2B@qaebT7tQ@Ohowucr1yjplAsxfbFezDFPPeYxv" rel="nofollow noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>

<p>(Note that gmpy2 isn't part of Python standard library and requires separated installation)</p>


blocks|key|777221|text|派克，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|777222|?+b!!R%2Bbhbt|code-block|syntax|javascript|777223|在这里试试！|unstyled|777224|?+b+++++++++-+Change+default+base+of+`base`+command+to+36+
++++++++++++-++This+is+kind+of+clever+because+it+modifies+the+list+of+characters+
++++++++++++-++the+command+uses+to+exactly+the+same+as+it+was+originally,+whilst
++++++++++++-++forcing+an+overwrite+from+the+default+settings+of+10.+
++++++++++++-++The+default+setup+works+for+base+36,+you+just+have+to+specify+it
++++++++++++-++time+when+using+the+command.
++++++++++++-++Literally+`b.contents+=+modify(b.contents,+func=lambda:+noop)`
+++!!+++++++-+The+previous+command+returns+`0123456789abcdefghijklmnopqrstuvwxyz`
++++++++++++-++So+we+convert+it+into+a+1+with+(not+not+%5E)+for+the+following+command:
+++++R%2B+++++-+++++"1"%2Binput
+++++++b++++-++++base(%5E,+36)
++++++++h+++-+++%5E+%2B+1
+++++++++b++-++base(%5E,+36)
++++++++++t+-+%5E[1:]|777225|如果使用十六进制模式，那么将所有base_36和base_10用法更改为base_92+(在这个上下文中它实际上不是92+)。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/muddyfish/PYKE|1|https://pyke.catbus.co.uk/?code=%253F%2Bb%2521%2521R%252Bbhbt&input=0zzzzzzzzz%250A&warnings=1&hex=0^0|0|2|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|F|7|17|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|18|8|@]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/muddyfish/PYKE" rel="nofollow noreferrer">Pyke</a>, 11 bytes</h1>
<pre><code>? b!!R+bhbt
</code></pre>
<p><a href="https://pyke.catbus.co.uk/?code=%3F+b%21%21R%2Bbhbt&amp;input=0zzzzzzzzz%0A&amp;warnings=1&amp;hex=0" rel="nofollow noreferrer">Try it here!</a></p>
<pre><code>? b         - Change default base of `base` command to 36 
            -  This is kind of clever because it modifies the list of characters 
            -  the command uses to exactly the same as it was originally, whilst
            -  forcing an overwrite from the default settings of 10. 
            -  The default setup works for base 36, you just have to specify it
            -  time when using the command.
            -  Literally `b.contents = modify(b.contents, func=lambda: noop)`
   !!       - The previous command returns `0123456789abcdefghijklmnopqrstuvwxyz`
            -  So we convert it into a 1 with (not not ^) for the following command:
     R+     -     &quot;1&quot;+input
       b    -    base(^, 36)
        h   -   ^ + 1
         b  -  base(^, 36)
          t - ^[1:]
</code></pre>
<p>Could be 2 bytes shorter with the following language change: If hex mode is used, change all base_36 and base_10 usages to base_92 (which isn't really base 92 in that context anyway)</p>


blocks|key|777739|text|sed，94字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|777740|s/$/#:0123456789abcdefghijklmnopqrstuvwxyz#0/
:l
s/$.$#$.*:.*\1$$#*.$/\3\2\3/
tl
s/:.*//|code-block|syntax|javascript|777741|在网上试试！|unstyled|777742|Sed由于必须通过查找更改字符而遭受了很大的损失。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gnu.org/software/sed/|1|https://tio.run/##K05N0U3PK/3/v1hfRV/ZysDQyNjE1MzcwjIxKTklNS09IzMrOyc3L7@gsKi4pLSsvKKyStlAn8sqh6tYP0ZDL0ZTGUhqWelpxRjGaMZoKGsBhfRjjGOMYoz1uUpAqoBy@vr//xvAARecZYlgVnFBbK4CAqBocn5Kanp@ThoA^0|0|3|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|K|7|15|8|@]|9|@]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://www.gnu.org/software/sed/" rel="nofollow noreferrer">sed</a>, 94 bytes</h1>

<pre><code>s/$/#:0123456789abcdefghijklmnopqrstuvwxyz#0/
:l
s/$.$#$.*:.*\1$$#*.$/\3\2\3/
tl
s/:.*//
</code></pre>

<p><a href="https://tio.run/##K05N0U3PK/3/v1hfRV/ZysDQyNjE1MzcwjIxKTklNS09IzMrOyc3L7@gsKi4pLSsvKKyStlAn8sqh6tYP0ZDL0ZTGUhqWelpxRjGaMZoKGsBhfRjjGOMYoz1uUpAqoBy@vr//xvAARecZYlgVnFBbK4CAqBocn5Kanp@ThoA" rel="nofollow noreferrer" title="sed – Try It Online">Try it online!</a></p>

<p>Sed suffers a lot for having to change the characters by lookup.</p>


blocks|key|776648|text|果冻，21字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|776649|ØBḊiⱮḅ‘bɗ36Ż9¡ṫ-9‘ịØB|code-block|syntax|javascript|776650|在网上试试！|unstyled|776651|使用大写字母。TIO链路也允许低/混合情况。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jelly|1|https://tio.run/##y0rNyan8///wDKeHO7oyH21c93BH66OGGUknpxubHd1teWjhw52rdS2BIg93dwMV/T86qfRw@///SoZGxiamZlVAoAQA^0|0|2|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|K|7|15|8|@]|9|@]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://github.com/DennisMitchell/jelly" rel="nofollow noreferrer">Jelly</a>, 21 bytes</h1>

<pre><code>ØBḊiⱮḅ‘bɗ36Ż9¡ṫ-9‘ịØB
</code></pre>

<p><a href="https://tio.run/##y0rNyan8///wDKeHO7oyH21c93BH66OGGUknpxubHd1teWjhw52rdS2BIg93dwMV/T86qfRw@///SoZGxiamZlVAoAQA" rel="nofollow noreferrer" title="Jelly – Try It Online">Try it online!</a></p>

<p>Uses uppercase. TIO link allows for lower/mixed case too.</p>


blocks|key|773970|text|灵丹妙药，70字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|773971|fn+x->"1"<>x=Integer.to_string+1%2BString.to_integer("1"<>x,36),36;x+end|code-block|syntax|javascript|773972|解释：|unstyled|773973|准备1到输入，将其转换为基36中的整数，递增它，将其转换为基36中的字符串，并将其匹配到"1"+<>+x+(反向级联)，然后返回x。|style|CODE|773974|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://elixir-lang.org/|1|https://tio.run/##LYoxC8IwFIR3f0V40wvWQKx2qWbv5OAmQin1GQLhWZIMGfzvMVoP7jjuO/Iuu1CwPFnknQENJ5PPAyeyFFR6jTEFx1bo7fVXvpNbKa7npu1kdZ8F8aNIhf9joMVPM40pTM7XAYeLspQiAshGwJ2hJki5eRtRkeO40JxQFr1vD8fuVvUB^0|0|4|0|0|0|0|2|1|18|8|1S|1|0|0|6|1^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@]|C|$]]|$1|L|3|M|5|K|7|16|8|@$A|17|B|18|N|O]|$A|19|B|1A|N|O]|$A|1B|B|1C|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="https://elixir-lang.org/" rel="nofollow noreferrer">Elixir</a>, 70 bytes</h1>

<pre><code>fn x-&gt;"1"&lt;&gt;x=Integer.to_string 1+String.to_integer("1"&lt;&gt;x,36),36;x end
</code></pre>

<p>Explanation:</p>

<p>Prepends <code>1</code> to the input, converts it to an integer in base 36, increments it, converts it to a string in base 36, and matches it to <code>"1" &lt;&gt; x</code> (reverse concatenation), then returns <code>x</code>.</p>

<p><a href="https://tio.run/##LYoxC8IwFIR3f0V40wvWQKx2qWbv5OAmQin1GQLhWZIMGfzvMVoP7jjuO/Iuu1CwPFnknQENJ5PPAyeyFFR6jTEFx1bo7fVXvpNbKa7npu1kdZ8F8aNIhf9joMVPM40pTM7XAYeLspQiAshGwJ2hJki5eRtRkeO40JxQFr1vD8fuVvUB" rel="nofollow noreferrer" title="Elixir – Try It Online">Try it online!</a></p>


blocks|key|774503|text|C#+(.NET+Core)，125个字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|774504|a=>{var+x="";for(int+i=9;;i--){var+y=a[i]==90?'0':a[i]==57?'A':(char)(a[i]%2B1);x=y%2Bx;a=a.Remove(i);if(y>48)break;}return+a%2Bx;}|code-block|syntax|javascript|774505|在网上试试！|unstyled|774506|未高尔夫球：|774507|a+=>+{
++++var+x+=+"";+++++++++++++++++//+initialize+x
++++for+(int+i+=+9;+;+i--)++++++//+starting+at+9+(length+of+string+minus+one)+and+decrementing+i+indefinitely
++++{
++++++++var+y+=+a[i]+==+90+?++++++++//+if+the+last+character+of+a+is+'Z'
++++++++++++'0'+:+++++++++++++++++++++++//+y+=+'0'
++++++++++++a[i]+==+57+?++++++++++++++++//+if+the+last+character+of+a+is+'9'
++++++++++++++++'A':++++++++++++++++++++++++//+y+=+'A'
++++++++++++++++(char)(a[i]+%2B+1);+++++++++++//+y+=+the+ascii+value+of+last+character+plus+1
++++++++x+=+y+%2B+x;++++++++++++++++++//+prepend+y+to+x
++++++++a+=+a.Remove(i);++++++++++++//+remove+the+last+character+of+a
++++++++if+(y+>+48)+++++++++++++++++//+if+y+is+a+character+other+than+'0',
++++++++++++break;++++++++++++++++++++++//+break+from+the+loop
++++}
++++return+a+%2B+x;+++++++++++++++//+return+the+remainder+of+a,+with+x+appended
}|entityMap|0|LINK|mutability|MUTABLE|url|https://www.microsoft.com/net/core/platform|1|https://tio.run/##NY5BS8NAFITv@RWPXrJLTYmgaPrclCJ40ks9iIiH5/ZFH7a7sLspCSG/PVZr5zLMzHcYGwvrA09tFPcJz31MvEewO4oR1jBkMVESCw@ts3cxhSN0cbIaGjORqYcDBejMbIaND0pcAjEVohSF/pt6Q2/ybkxVrvIyX57C9c0qX@dLZb8oaPXbzS81dqafd0iGFhve@wMr0SiN6uurW/0RmL5xDJza4ICO3Djh@d3ByxaeSJzSQwYA995Fv@PFS5DEqlHnvGHaPopjpbXGbByn1/Jf1Q8^0|0|E|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|K|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://www.microsoft.com/net/core/platform" rel="nofollow noreferrer">C# (.NET Core)</a>, 125 bytes</h1>



<pre class="lang-cs prettyprint-override"><code>a=&gt;{var x="";for(int i=9;;i--){var y=a[i]==90?'0':a[i]==57?'A':(char)(a[i]+1);x=y+x;a=a.Remove(i);if(y&gt;48)break;}return a+x;}
</code></pre>

<p><a href="https://tio.run/##NY5BS8NAFITv@RWPXrJLTYmgaPrclCJ40ks9iIiH5/ZFH7a7sLspCSG/PVZr5zLMzHcYGwvrA09tFPcJz31MvEewO4oR1jBkMVESCw@ts3cxhSN0cbIaGjORqYcDBejMbIaND0pcAjEVohSF/pt6Q2/ybkxVrvIyX57C9c0qX@dLZb8oaPXbzS81dqafd0iGFhve@wMr0SiN6uurW/0RmL5xDJza4ICO3Djh@d3ByxaeSJzSQwYA995Fv@PFS5DEqlHnvGHaPopjpbXGbByn1/Jf1Q8" rel="nofollow noreferrer" title="C# (.NET Core) – Try It Online">Try it online!</a></p>

<p>Ungolfed:</p>

<pre class="lang-cs prettyprint-override"><code>a =&gt; {
    var x = "";                 // initialize x
    for (int i = 9; ; i--)      // starting at 9 (length of string minus one) and decrementing i indefinitely
    {
        var y = a[i] == 90 ?        // if the last character of a is 'Z'
            '0' :                       // y = '0'
            a[i] == 57 ?                // if the last character of a is '9'
                'A':                        // y = 'A'
                (char)(a[i] + 1);           // y = the ascii value of last character plus 1
        x = y + x;                  // prepend y to x
        a = a.Remove(i);            // remove the last character of a
        if (y &gt; 48)                 // if y is a character other than '0',
            break;                      // break from the loop
    }
    return a + x;               // return the remainder of a, with x appended
}
</code></pre>


<p>This is a code golf version of a similar question <a href="https://stackoverflow.com/questions/51492374/get-the-point-where-the-replace-occurred-in-a-replace#51493248">I asked on stack earlier</a> but thought it'd be an interesting puzzle.</p>
<p>Given a string of length 10 which represents a base 36 number, increment it by one and return the resulting string.</p>
<p>This means the strings will only contain digits from <code>0</code> to <code>9</code> and letters from <code>a</code> to <code>z</code>.</p>
<p>Base 36 works as follows:</p>
<p>The right most digit is incremented, first by using <code>0</code> to <code>9</code></p>
<blockquote>
<h1>0000000000 &gt; 9 iterations &gt; 0000000009</h1>
</blockquote>
<p>and after that <code>a</code> to <code>z</code> is used:</p>
<blockquote>
<h1>000000000a &gt; 25 iterations &gt; 000000000z</h1>
</blockquote>
<p>If <code>z</code> needs to be incremented it loops back to zero and the digit to its left is incremented:</p>
<blockquote>
<h1>000000010</h1>
</blockquote>
<h3>Further rules:</h3>
<ul>
<li>You may use upper case or lower case letters.</li>
<li>You may <strong>not</strong> drop leading zeros. Both input and output are strings of length 10.</li>
<li>You do not need to handle <code>zzzzzzzzzz</code> as input.</li>
</ul>
<h3>Test Cases:</h3>
<pre><code>&quot;0000000000&quot; -&gt; &quot;0000000001&quot;
&quot;0000000009&quot; -&gt; &quot;000000000a&quot;
&quot;000000000z&quot; -&gt; &quot;0000000010&quot;
&quot;123456zzzz&quot; -&gt; &quot;1234570000&quot;
&quot;00codegolf&quot; -&gt; &quot;00codegolg&quot;
</code></pre>


Increment base-36 strings

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

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

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

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

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

EdgeOne AI 安全实战专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

这是一个代码高尔夫版本的类似的问题我之前问过堆栈，但认为这将是一个有趣的谜题。给定一个长度为10的字符串，该字符串表示一个基数为36的数字，将其增量为1，并返回结果字符串。这意味着字符串将只包含从0到9的数字和从a到z的字母。基础36的工作如下：最右边的数字是递增的，首先是使用0到9。0000000000 >9次迭代> 0000000009次在此之后，使用a to z：000000000a > 2

问增量基-36字符串
EN

进一步规则：

测试用例：

回答 19

Code Golf用户

05AB1E，10字节

码

解释

Code Golf用户

杰夫特，13字节

解释

Code Golf用户

斯塔克斯，7 字节数

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问增量基-36字符串EN

进一步规则：

测试用例：

回答 19

Code Golf用户

05AB1E，10字节

码

解释

Code Golf用户

杰夫特，13字节

解释

Code Golf用户

斯塔克斯，7 字节数

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问增量基-36字符串
EN