blocks|key|6104291|text|实际上是7字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6104292|ú'+%2BûEí|code-block|syntax|javascript|6104293|在网上试试！|unstyled|offset|length|6104294|解释：|6104295|ú'+%2BûEí
ú'+%2B+++++lowercase+English+alphabet,+prepend+space
++++û++++uppercase
+++++E+++element+(pushes+the+nth+letter+if+input+is+an+integer,+leaves+stack+alone+otherwise)
++++++í++index+(pushes+index+of+input+if+input+is+a+string,+leaves+stack+alone+otherwise)|6104296|如果小写可以接受，这是6个字节：|6104297|ú'+%2BEí|6104298|entityMap|0|LINK|mutability|MUTABLE|url|http://actually.tryitonline.net/#code=w7onICvDu0XDrQ&input=IkUi|1|http://actually.tryitonline.net/#code=w7onICtFw60&input=ImUi^0|0|0|0|6|0|0|0|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|13|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|14|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|15|8|@]|9|@$J|16|K|17|1|18]]|A|$]]|$1|L|3|M|5|I|7|19|8|@]|9|@]|A|$]]|$1|N|3|O|5|D|7|1A|8|@]|9|@]|A|$E|F]]|$1|P|3|Q|5|I|7|1B|8|@]|9|@]|A|$]]|$1|R|3|S|5|D|7|1C|8|@]|9|@]|A|$E|F]]|$1|T|3|H|5|I|7|1D|8|@]|9|@$J|1E|K|1F|1|1G]]|A|$]]]|U|$V|$5|W|X|Y|A|$Z|10]]|11|$5|W|X|Y|A|$Z|12]]]]

<h2>Actually, 7 bytes</h2>
<pre><code>ú' +ûEí
</code></pre>
<p><a href="http://actually.tryitonline.net/#code=w7onICvDu0XDrQ&amp;input=IkUi" rel="noreferrer">Try it online!</a></p>
<p>Explanation:</p>
<pre><code>ú' +ûEí
ú' +     lowercase English alphabet, prepend space
    û    uppercase
     E   element (pushes the nth letter if input is an integer, leaves stack alone otherwise)
      í  index (pushes index of input if input is a string, leaves stack alone otherwise)
</code></pre>
<p>If lowercase is acceptable, this is 6 bytes:</p>
<pre><code>ú' +Eí
</code></pre>
<p><a href="http://actually.tryitonline.net/#code=w7onICtFw60&amp;input=ImUi" rel="noreferrer">Try it online!</a></p>


blocks|key|6103905|text|Erlang，26字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6103906|f([X])->X-64;f(X)->[X%2B64].|code-block|syntax|javascript|6103907|Erlang的字符串行为是有用的少数几次之一。|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|$]]

<h1>Erlang, 26 bytes</h1>
<pre><code>f([X])-&gt;X-64;f(X)-&gt;[X+64].
</code></pre>
<p>One of the few times where Erlang's string behavior is useful.</p>


blocks|key|677909|text|Python2，38个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|677910|lambda+x:x>''and+64%5Eord(x)or+chr(64%5Ex)|code-block|syntax|javascript|677911|在艾德龙上进行测试。|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|http://ideone.com/E9pcsJ^0|0|0|1|3|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@$J|V|K|W|1|X]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>Python 2, 38 bytes</h1>

<pre class="lang-python prettyprint-override"><code>lambda x:x&gt;''and 64^ord(x)or chr(64^x)
</code></pre>

<p>Test it on <a href="http://ideone.com/E9pcsJ">Ideone</a>.</p>


blocks|key|678244|text|Python+3，43字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|678245|lambda+x:x!=str(x)and+chr(64%7Cx)or+ord(x)%5E64|code-block|syntax|javascript|678246|这个解决方案的有趣之处在于它包含了OR、位或%7C、逻辑OR+or、位异或%5E和逻辑异或!=的所有意义。|unstyled|offset|length|style|CODE|entityMap^0|0|0|M|1|T|2|Z|1|15|2^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Q|8|@$J|R|K|S|L|M]|$J|T|K|U|L|M]|$J|V|K|W|L|M]|$J|X|K|Y|L|M]]|9|@]|A|$]]]|N|$]]

<h1>Python 3, 43 bytes</h1>

<pre class="lang-python prettyprint-override"><code>lambda x:x!=str(x)and chr(64|x)or ord(x)^64
</code></pre>
<p>The interesting thing about this solution is that it incorporates all the senses of OR, bitwise OR <code>|</code>, logical OR <code>or</code>, bitwise XOR <code>^</code> and logical XOR <code>!=</code> ...</p>


blocks|key|6103998|text|Haskell，54字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6103999|f+s%7Cs<"A"=[['@'..]s]%7C1<2=show$fromEnum(s0)-64|code-block|syntax|javascript|6104000|用法示例：map+f+["1","26","A","Z"]+->+["A","Z","1","26"]。|unstyled|offset|length|style|CODE|6104001|Haskell的严格的类型系统在这里是一个真正的痛苦。此外，所有简短的char+<->+int函数(如chr和ord+)都需要导入，所以我必须手工完成。例如，对于字母->+int情况，我需要转换String+->+Char+(通过!!0)+->+Integer+(通过fromEnum)+->+String+(通过show)。|entityMap^0|0|0|5|O|X|I|0|1F|3|1J|3|2P|6|2Z|4|37|3|3F|7|3Q|8|43|6|4D|4^^$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]|$J|10|K|11|L|M]|$J|12|K|13|L|M]|$J|14|K|15|L|M]|$J|16|K|17|L|M]|$J|18|K|19|L|M]|$J|1A|K|1B|L|M]|$J|1C|K|1D|L|M]|$J|1E|K|1F|L|M]]|9|@]|A|$]]]|P|$]]

<h2>Haskell, 54 bytes</h2>

<pre><code>f s|s&lt;"A"=[['@'..]!!read s]|1&lt;2=show$fromEnum(s!!0)-64
</code></pre>

<p>Usage example: <code>map f ["1","26","A","Z"]</code> -> <code>["A","Z","1","26"]</code>.</p>

<p>Haskell's strict type system is a real pain here. Additionally all the short char &lt;-> int functions like <code>chr</code> and <code>ord</code> need an import, so I have to do it by hand. For the letter -> int case, for example I need to convert <code>String</code> -> <code>Char</code> (via <code>!!0</code>) -> <code>Integer</code> (via <code>fromEnum</code>) -> <code>String</code> (via <code>show</code>).</p>


blocks|key|677929|text|C，55字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|677930|i;f(char*s){i=atol(s);printf(i?"%25c":"%25d",64%5E(i?i:*s));}|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|$]]

<h1>C, 55 bytes</h1>

<pre><code>i;f(char*s){i=atol(s);printf(i?"%c":"%d",64^(i?i:*s));}
</code></pre>


blocks|key|6104398|text|C#，32字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6104399|n=>(n%5E=64)>26?(object)(char)n:n;|code-block|syntax|javascript|6104400|将数据转换为Func<int,+object>。|unstyled|offset|length|style|CODE|6104401|输入：char隐式转换为int，因此可以用int+(1-26)或char+(‘A’-Z)调用。|6104402|输出：char或int。|entityMap^0|0|0|6|H|0|3|4|C|3|L|3|W|4|0|3|4|8|3^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@$J|V|K|W|L|M]]|9|@]|A|$]]|$1|N|3|O|5|I|7|X|8|@$J|Y|K|Z|L|M]|$J|10|K|11|L|M]|$J|12|K|13|L|M]|$J|14|K|15|L|M]]|9|@]|A|$]]|$1|P|3|Q|5|I|7|16|8|@$J|17|K|18|L|M]|$J|19|K|1A|L|M]]|9|@]|A|$]]]|R|$]]

<h1>C#, 32 bytes</h1>
<pre><code>n=&gt;(n^=64)&gt;26?(object)(char)n:n;
</code></pre>
<p>Casts to <code>Func&lt;int, object&gt;</code>.</p>
<p>Input: <code>char</code> implicitely converts to <code>int</code> so can be called with <code>int</code> (1-26) or <code>char</code> ('A'-Z').</p>
<p>Output: Either a <code>char</code> or <code>int</code>.</p>


blocks|key|678673|text|Excel，33字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|678674|=IFERROR(CHAR(A1%2B64),CODE(A1)-64)|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|$]]

<h1>Excel, 33 bytes</h1>

<pre><code>=IFERROR(CHAR(A1+64),CODE(A1)-64)
</code></pre>


blocks|key|6103956|text|Python2，61个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6103957|i=raw_input()
try:o=chr(int(i)%2B64)
except:o=ord(i)-64
print+o|code-block|syntax|javascript|6103958|是的，我可以转到input的Python3|unstyled|offset|length|style|CODE|entityMap^0|0|0|8|5^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Q|8|@$J|R|K|S|L|M]]|9|@]|A|$]]]|N|$]]

<h1>Python 2, 61 bytes</h1>

<pre class="lang-python prettyprint-override"><code>i=raw_input()
try:o=chr(int(i)+64)
except:o=ord(i)-64
print o
</code></pre>
<p>Yes I could switch to Python 3 for <code>input</code></p>


blocks|key|6104790|text|Befunge-98*，19字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6104791|&:39*\`'@\j;%2B,@;-.@|code-block|syntax|javascript|6104792|因为问题是说你会收到一个1-26或A-Z，我认为这意味着数字26或字符an。大多数解释都很难输入alt代码，因此更容易使用&，输入26的26或90的“Z”值，而不是~。|unstyled|style|CODE|6104793|伪码|6104794|int+c+=+get+stdin
push+the+value+of+27
bool+is_number+=++27+>+c
push+the+value+of+`@`+(64)
if+is_number+==+1
+++jump+to+adding+64+to+c+//putting+it+the+ASCII+range
+++print+as+ASCII
+++end
else
+++jump+to+subtracting+64+from+c+//putting+it+in+the+numerical+range
+++print+as+number
+++end|6104795|(在Windows上)测试这里！|6104796|*这在技术上是Unefunge-98，因为它只使用一维，但这个名称可能不熟悉。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/catseye/Funge-98/blob/master/doc/funge98.markdown|1|https://github.com/tngreene/BefungeSharp^0|0|A|0|0|0|C|4|H|3|1P|1|2A|1|0|0|0|D|3|1|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|@$A|1A|B|1B|L|M]|$A|1C|B|1D|L|M]|$A|1E|B|1F|L|M]|$A|1G|B|1H|L|M]]|9|@]|C|$]]|$1|N|3|O|5|6|7|1I|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1J|8|@]|9|@]|C|$G|H]]|$1|R|3|S|5|K|7|1K|8|@]|9|@$A|1L|B|1M|1|1N]]|C|$]]|$1|T|3|U|5|K|7|1O|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/catseye/Funge-98/blob/master/doc/funge98.markdown" rel="nofollow">Befunge-98</a>*, 19 bytes</h1>

<pre><code>&amp;:39*\`'@\j;+,@;-.@
</code></pre>

<p>Because the question said you'll receive a <code>1-26</code> or an <code>A-Z</code> I assumed this meant the number 26 or the character A-Z. Most interprets struggle with entering alt-codes, so it is easier to use <code>&amp;</code> and enter values like 26 for 26 or 90 for 'Z', as opposed to <code>~</code>.</p>

<h2>Pseudo-code</h2>

<pre><code>int c = get stdin
push the value of 27
bool is_number =  27 &gt; c
push the value of `@` (64)
if is_number == 1
   jump to adding 64 to c //putting it the ASCII range
   print as ASCII
   end
else
   jump to subtracting 64 from c //putting it in the numerical range
   print as number
   end
</code></pre>

<p>Test it out (on Windows) <a href="https://github.com/tngreene/BefungeSharp" rel="nofollow">here!</a></p>

<p>*This is technically Unefunge-98 because it only uses 1 dimension, but that name might be unfamiliar.</p>


blocks|key|678651|text|Brainfuck，445字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|678652|更多的是一个概念的证明，而不是一个金色的代码。需要无签名的，无包装的Brainfuck。|unstyled|678653|,[>%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%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%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|678654|附评论|678655|,[>%2B>%2B<<-]+Firstly+Duplicate+it+across+two+buffers
>[<%2B>-]+Move+the+second+buffer+back+to+the+first+buffer
>>%2B%2B[->%2B%2B%2B%2B%2B%2B<]>[-<<<%2B%2B%2B%2B%2B>>>]+Establish+60+in+the+second+buffer
<<<<
Compare+Buffers+1+and+2
[->-<]
>
[+If+there's+still+data+in+buffer+2
,+Write+the+value+in+the+units+column+to+buffer+two
<
%2B%2B%2B%2B
[->------------<]+Subtract+12+from+the+units+buffer
%2B%2B%2B%2B
[->>------------<<]+Subtract+12+from+the+tens+buffer
[-<<%2B%2B%2B%2B%2B%2B%2B%2B%2B%2B>>]+Multiply+buffer+three+by+ten+into+buffer+1
>
[-<%2B>]+Add+the+units
>
[-<<%2B%2B%2B%2B%2B%2B%2B%2B%2B%2B>>]+Add+the+tens
>%2B%2B+Add+65+to+the+buffer
[->%2B%2B%2B%2B%2B%2B<]>%2B
[-<%2B%2B%2B%2B%2B>]
<-+Actually+we+need+64+because+A+is+1
[-<<<%2B>>>]+Add+64+to+the+first+buffer
<<<
.+Print+the+new+letter
>+Move+to+blank+buffer
]
>
[+Otherwise+we're+a+letter
[-<%2B<%2B>>]+Copy+it+back+over+the+first+two+buffers
>%2B%2B+Write+64+to+the+buffer
[->%2B%2B%2B%2B%2B%2B<]>%2B
[-<%2B%2B%2B%2B%2B>]
<-
[-<<->>]+Subtract+64+from+the+letter
<<[->%2B>%2B<<]
>>>%2B%2B%2B%2B%2B%2B%2B%2B%2B%2B<+Copy+pasted+Division+step+x+=+current+buffer+y+=+10+rest+of+the+buffers+are+conveniently+blank

%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%2B%2B<<]
>>.<<<.>
]+|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|Q|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|R|8|@]|9|@]|A|$]]|$1|L|3|M|5|G|7|S|8|@]|9|@]|A|$H|I]]]|N|$]]

<h1>Brainfuck, 445 Characters</h1>

<p>More a proof of concept than a golfed code.
Requires Unsigned, Non-wrapping Brainfuck.</p>

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

<p>With Comments</p>

<pre><code>,[&gt;+&gt;+&lt;&lt;-] Firstly Duplicate it across two buffers
&gt;[&lt;+&gt;-] Move the second buffer back to the first buffer
&gt;&gt;++[-&gt;++++++&lt;]&gt;[-&lt;&lt;&lt;+++++&gt;&gt;&gt;] Establish 60 in the second buffer
&lt;&lt;&lt;&lt;
Compare Buffers 1 and 2
[-&gt;-&lt;]
&gt;
[ If there's still data in buffer 2
, Write the value in the units column to buffer two
&lt;
++++
[-&gt;------------&lt;] Subtract 12 from the units buffer
++++
[-&gt;&gt;------------&lt;&lt;] Subtract 12 from the tens buffer
[-&lt;&lt;++++++++++&gt;&gt;] Multiply buffer three by ten into buffer 1
&gt;
[-&lt;+&gt;] Add the units
&gt;
[-&lt;&lt;++++++++++&gt;&gt;] Add the tens
&gt;++ Add 65 to the buffer
[-&gt;++++++&lt;]&gt;+
[-&lt;+++++&gt;]
&lt;- Actually we need 64 because A is 1
[-&lt;&lt;&lt;+&gt;&gt;&gt;] Add 64 to the first buffer
&lt;&lt;&lt;
. Print the new letter
&gt; Move to blank buffer
]
&gt;
[ Otherwise we're a letter
[-&lt;+&lt;+&gt;&gt;] Copy it back over the first two buffers
&gt;++ Write 64 to the buffer
[-&gt;++++++&lt;]&gt;+
[-&lt;+++++&gt;]
&lt;-
[-&lt;&lt;-&gt;&gt;] Subtract 64 from the letter
&lt;&lt;[-&gt;+&gt;+&lt;&lt;]
&gt;&gt;&gt;++++++++++&lt; Copy pasted Division step x = current buffer y = 10 rest of the buffers are conveniently blank

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


blocks|key|6105209|text|第四次(痛风)，67字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6105210|:+f+2dup+s>number?+if+d>s+64+%2B+emit+else+2drop+d>s+c@+64+-+.+then+;|code-block|syntax|javascript|6105211|在网上试试！|unstyled|6105212|输入作为字符串传递给函数。|6105213|代码解释|6105214|:+f+++++++++++++\+start+a+new+word+definition
++2dup++++++++++\+make+a+copy+of+the+input+string
++s>number?+++++\+attempt+to+convert+to+a+number+in+base+10
++if++++++++++++\+check+if+successful
++++d>s+++++++++\+drop+a+number+(don't+need+double-precision)
++++64+%2B+emit+++\+add+to+64+and+output+the+ascii+letter+at+that+value
++else++++++++++\+if+not+successful+(input+was+a+letter)
++++2drop+d>s+++\+get+rid+of+garbage+number+conversion+result+and+string-length
++++c@+64+-+.+++\+get+ascii+value+of+char,+subtract+64+and+output+
++then++++++++++\+end+the+if+block
;+++++++++++++++\+end+the+word+definition|entityMap|0|LINK|mutability|MUTABLE|url|http://www.complang.tuwien.ac.at/forth/gforth/Docs-html/|1|https://tio.run/##hY/dTgIxEIXveYrjcoHGXSIbgomYVV7DhYvSnUKTbqdpuyK@PLaAwTt7M3/nzDdV7OO@2qkcTqcXKNTd4BAaO/Rb8m/QCl0TsJjjEdTrCDKBksizOw/ke55VmCLuyWKZdrjLjnh0hJzUaSy2AcEJSQHTAqgaFIklPZZYw3ltI7R1Q8S9IRUrYfTOUpd6FxdYIejvBH4or/KiaorfnIeYvUmkSig2hg/JvD3C0sFoS6NR/YwZ2o43aPUGT3gdYxwwbtKxrWF2G6S3Rk6hPPdJHRn1ooRk@0k@n9fRV26GmJi7hBYhXIvcVoOVUbMdTVpMVjeWEx3k3TnMbrS/qFW2f5RpF3uC3AsvZCSfPx@pd@yFP/5HPf0A^0|0|7|0|0|0|0|6|1|0|0|0^^$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|@$A|16|B|17|1|18]]|C|$]]|$1|L|3|M|5|K|7|19|8|@]|9|@]|C|$]]|$1|N|3|O|5|6|7|1A|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1B|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="http://www.complang.tuwien.ac.at/forth/gforth/Docs-html/" rel="nofollow noreferrer">Forth (gforth)</a>, 67 bytes</h1>

<pre class="lang-forth prettyprint-override"><code>: f 2dup s&gt;number? if d&gt;s 64 + emit else 2drop d&gt;s c@ 64 - . then ;
</code></pre>
<p><a href="https://tio.run/##hY/dTgIxEIXveYrjcoHGXSIbgomYVV7DhYvSnUKTbqdpuyK@PLaAwTt7M3/nzDdV7OO@2qkcTqcXKNTd4BAaO/Rb8m/QCl0TsJjjEdTrCDKBksizOw/ke55VmCLuyWKZdrjLjnh0hJzUaSy2AcEJSQHTAqgaFIklPZZYw3ltI7R1Q8S9IRUrYfTOUpd6FxdYIejvBH4or/KiaorfnIeYvUmkSig2hg/JvD3C0sFoS6NR/YwZ2o43aPUGT3gdYxwwbtKxrWF2G6S3Rk6hPPdJHRn1ooRk@0k@n9fRV26GmJi7hBYhXIvcVoOVUbMdTVpMVjeWEx3k3TnMbrS/qFW2f5RpF3uC3AsvZCSfPx@pd@yFP/5HPf0A" rel="nofollow noreferrer" title="Forth (gforth) – Try It Online">Try it online!</a></p>
<p>Input is passed as a string to the function</p>
<h3>Code Explanation</h3>
<pre class="lang-forth prettyprint-override"><code>: f             \ start a new word definition
  2dup          \ make a copy of the input string
  s&gt;number?     \ attempt to convert to a number in base 10
  if            \ check if successful
    d&gt;s         \ drop a number (don't need double-precision)
    64 + emit   \ add to 64 and output the ascii letter at that value
  else          \ if not successful (input was a letter)
    2drop d&gt;s   \ get rid of garbage number conversion result and string-length
    c@ 64 - .   \ get ascii value of char, subtract 64 and output 
  then          \ end the if block
;               \ end the word definition
</code></pre>


blocks|key|678821|text|果冻，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|678822|i@ịe?ØA|code-block|syntax|javascript|678823|在网上试试！|unstyled|678824|是如何工作的|678825|i@ịe?ØA+-+Main+link.+Takes+an+input+A+on+the+left
+++++ØA+-+Set+the+right+argument+to+"ABC...XYZ"
++++?+++-+If+statement:
+++e++++-+++Condition:+left+in+right;+is+A+in+the+alphabet?
i@++++++-+++If+so:+return+the+1-index+of+A+in+the+alphabet
++ị+++++-+++Else:+yield+the+A'th+element+of+the+alphabet|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jelly|1|https://tio.run/##y0rNyan8/z/T4eHu7lT7wzMc/7sdbn/UtCby/39DHQVTHQUjEDbTUVByVAISHiAiEEREKQEA^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://github.com/DennisMitchell/jelly" rel="nofollow noreferrer">Jelly</a>, 7 bytes</h1>
<pre><code>i@ịe?ØA
</code></pre>
<p><a href="https://tio.run/##y0rNyan8/z/T4eHu7lT7wzMc/7sdbn/UtCby/39DHQVTHQUjEDbTUVByVAISHiAiEEREKQEA" rel="nofollow noreferrer" title="Jelly – Try It Online">Try it online!</a></p>
<h2>How it works</h2>
<pre><code>i@ịe?ØA - Main link. Takes an input A on the left
     ØA - Set the right argument to &quot;ABC...XYZ&quot;
    ?   - If statement:
   e    -   Condition: left in right; is A in the alphabet?
i@      -   If so: return the 1-index of A in the alphabet
  ị     -   Else: yield the A'th element of the alphabet
</code></pre>


blocks|key|678855|text|q，29字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|678856|{@[1%2B.Q.A?;x;{.Q.A+y-1}[;x]]}|code-block|syntax|javascript|678857|在大写字母的内置列表中查找我们的字母所在的索引。|unstyled|678858|如果出现错误，则将其索引到与输入相同的列表中|678859|当q索引从0开始，而不是从1开始时添加和删除|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Q|8|@]|9|@]|A|$]]|$1|J|3|K|5|I|7|R|8|@]|9|@]|A|$]]|$1|L|3|M|5|I|7|S|8|@]|9|@]|A|$]]]|N|$]]

<h1>q, 29 bytes</h1>
<pre><code>{@[1+.Q.A?;x;{.Q.A y-1}[;x]]}
</code></pre>
<p>Find the index at which our letter occurs in the built-in list of uppercase letters</p>
<p>If it errors, index into the same list with the input instead</p>
<p>Adding and taking away ones as q indexing starts at 0, not 1</p>


blocks|key|6103881|text|傅里叶，30字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6103882|I~F<64{1}{F%2B64a}F>64{1}{F-64o}|code-block|syntax|javascript|6103883|在网上试试！|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|http://fourier.tryitonline.net/#code=SX5GPDY0ezF9e0YrNjRhfUY-NjR7MX17Ri02NG99&input=RQ^0|0|0|0|6|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@$J|V|K|W|1|X]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>Fourier, 30 bytes</h1>

<pre><code>I~F&lt;64{1}{F+64a}F&gt;64{1}{F-64o}
</code></pre>

<p><a href="http://fourier.tryitonline.net/#code=SX5GPDY0ezF9e0YrNjRhfUY-NjR7MX17Ri02NG99&amp;input=RQ" rel="nofollow"><strong>Try it online!</strong></a></p>


blocks|key|677884|text|JavaScript+(ES6)，49字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|677885|s=>s>0?String.fromCharCode(s%7C64):parseInt(s,36)-9|code-block|syntax|javascript|677886|接受数字或字符串格式的整数，始终将整数作为数字返回。如果可以返回小写，并且不需要处理字符串格式的整数，则为42个字节：|unstyled|677887|s=>s>0?(s%2B9).toString(36):parseInt(s,36)-9|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>JavaScript (ES6), 49 bytes</h2>

<pre><code>s=&gt;s&gt;0?String.fromCharCode(s|64):parseInt(s,36)-9
</code></pre>

<p>Accepts integers in either number or string format, always return integers as a number. 42 bytes if I can return lower case and don't need to handle integers in string format:</p>

<pre><code>s=&gt;s&gt;0?(s+9).toString(36):parseInt(s,36)-9
</code></pre>


blocks|key|6104646|text|R，73字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6104647|f=function(x){L=LETTERS;if(is.numeric(x)){i=L[(x)]}else{i=which(L==x)};i}|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>R, 73 bytes</h2>

<pre><code>f=function(x){L=LETTERS;if(is.numeric(x)){i=L[(x)]}else{i=which(L==x)};i}
</code></pre>


blocks|key|678519|text|矩阵，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|678520|6WZ~t42>?c|code-block|syntax|javascript|678521|解释：|unstyled|678522|6W++++++++++++++%25+2**6+=+64,+but+golfier+looking
++Z~++++++++++++%25+bit-wise+XOR+with+input
++++t42>?+++++++%25+if+result+is+greater+than+42
+++++++++c++++++%25+convert+it+to+a+character+
++++++++++++++++%25+else,+don't|678523|带有数字输入的在网上试试！。|offset|length|678524|678525|具有字母输入的在网上试试！。|entityMap|0|LINK|mutability|MUTABLE|url|http://matl.tryitonline.net/#code=NldafnQ0Mj4_Yw&input=WzE6MjZd|1|http://matl.tryitonline.net/#code=NldafnQ0Mj4_Yw&input=WydBJzonWidd^0|0|0|0|0|7|6|0|0|0|7|6|1^^$0|@$1|2|3|4|5|6|7|11|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|12|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|13|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|14|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|15|8|@]|9|@$N|16|O|17|1|18]]|A|$]]|$1|P|3|-4|5|I|7|19|8|@]|9|@]|A|$]]|$1|Q|3|R|5|I|7|1A|8|@]|9|@$N|1B|O|1C|1|1D]]|A|$]]]|S|$T|$5|U|V|W|A|$X|Y]]|Z|$5|U|V|W|A|$X|10]]]]

<h1>MATL, 10 bytes</h1>
<pre><code>6WZ~t42&gt;?c
</code></pre>
<p>Explanation:</p>
<pre><code>6W              % 2**6 = 64, but golfier looking
  Z~            % bit-wise XOR with input
    t42&gt;?       % if result is greater than 42
         c      % convert it to a character 
                % else, don't
</code></pre>
<p><a href="http://matl.tryitonline.net/#code=NldafnQ0Mj4_Yw&amp;input=WzE6MjZd" rel="nofollow noreferrer">Try it online!</a> with numeric inputs.<br />
<a href="http://matl.tryitonline.net/#code=NldafnQ0Mj4_Yw&amp;input=WydBJzonWidd" rel="nofollow noreferrer">Try it online!</a> with alphabetic inputs.</p>


blocks|key|6104857|text|ASM:+10字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6104858|3C+40+77+04+2C+40+EB+02+04+40|code-block|syntax|javascript|6104859|说明:这是程序的集合表示，它完全按照要求执行。它不是完全功能，因为它需要一些指令，但是如果它被添加到一个程序集程序的代码段中，它应该可以工作。它接收AL寄存器中的输入，如果它是一个字母，则从ASCII代码值中减去40h，只留下数字(即B=42h，42h-40h=2h)。如果输入是一个数字，则通过添加40h执行相反的过程。它将结果留在AL寄存器中。下面是程序集源代码|unstyled|6104860|cmp+al,40h
ja+letter_to_number
sub+al,40h
jmp+continue
letter_to_number:+add+ax,40h
continue:|6104861|另外，如果你把所有其他答案转换成机器代码，我肯定我的答案是最小的。|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Q|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|R|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|S|8|@]|9|@]|A|$]]]|N|$]]

<p><strong>ASM: 10 bytes</strong> </p>

<pre><code>3C 40 77 04 2C 40 EB 02 04 40
</code></pre>

<p>Explanation:
This is the assembled representation of a program that does exactly what is asked. It is not fully functional, because it needs some directives, but if it is added to the code segment of an assembly program it should work. It receives the input in the AL register, and if its a letter it subtracts 40h from the ASCII code value, leaving just the number(i.e B=42h, 42h-40h=2h). If the input is a number it does the opposite procedure by adding 40h. It leaves the result in the AL register. Below is the assembly source code</p>

<pre><code>cmp al,40h
ja letter_to_number
sub al,40h
jmp continue
letter_to_number: add ax,40h
continue:
</code></pre>

<p>Also,  if you convert all the other answers to machine code, I am positive that mine would be the smallest.</p>


blocks|key|6104922|text|Java，61个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6104923|int+f(char+c){return+c%5E64;}char+f(int+i){return(char)(i%5E64);}|code-block|syntax|javascript|6104924|不打高尔夫球：|unstyled|6104925|int+f(char+c)+{
++++return+c%5E64;
}

char+f(int+i)+{
++++return+(char)+(i%5E64);
}|6104926|调用f('A')调用第一个函数，重新处理一个int+1；调用f(1)调用第二个函数，返回char+"A“。|offset|length|style|CODE|entityMap^0|0|0|0|0|2|6|M|3|U|4|18|4^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|W|8|@$N|X|O|Y|P|Q]|$N|Z|O|10|P|Q]|$N|11|O|12|P|Q]|$N|13|O|14|P|Q]]|9|@]|A|$]]]|R|$]]

<h2>Java, 61 bytes</h2>
<pre><code>int f(char c){return c^64;}char f(int i){return(char)(i^64);}
</code></pre>
<p>Ungolf'd:</p>
<pre><code>int f(char c) {
    return c^64;
}

char f(int i) {
    return (char) (i^64);
}
</code></pre>
<p>Calling <code>f('A')</code> invokes the first function, retuning an <code>int</code> 1;  calling <code>f(1)</code> invokes the second function, returning the <code>char</code> &quot;A&quot;.</p>


blocks|key|678739|text|05AB1E+(遗产)，9+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|678740|di.bëÇ64-|code-block|syntax|javascript|678741|在网上试试或验证所有测试用例.|unstyled|678742|同样适用于05AB1E的新版本，而不是遗留版本，但是Ç封装在一个列表中：在网上试试或验证所有测试用例。|style|CODE|678743|Explanation:|678744|di++++++#+Legacy+05AB1E+version:+If+the+(implicit)+input+is+an+integer:
++++++++#+New+05AB1E+version:+If+the+(implicit)+input+is+a+positive+(>=+0)+integer:
++.b++++#++Builtin+to+convert+the+integer+to+its+1-based+uppercase+alphabetic+letter
+ë++++++#+Else:
++Ç+++++#++Get+the+codepoint+of+the+uppercase+letter
+++64-++#++And+subtract+64+to+convert+it+to+its+1-based+index
++++++++#+(after+which+the+result+is+output+implicitly)|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E/wiki/Commands|1|https://github.com/Adriandmen/05AB1E/wiki/Codepage|2|https://tio.run/##MzBNTDJM/f8/JVMv6fDqw@1mJrr//7sCAA|3|https://tio.run/##MzBNTDJM/a/kVpSfa6WgZO9YGvyoqcnn0GpbLqWQfCsFBaDYua0u/1My9ZIOrz7cbmai@7@2Vuc/AA|4|https://tio.run/##yy9OTMpM/f8/JVMv6fDqw@1mJrr//7sCAA|5|https://tio.run/##yy9OTMpM/a/kVpSfa6WgZO9YGvyoqcnn0GpbLqWQfCsFBaDYua0u/1My9ZIOrz7cbmai@7@2Vuc/AA^0|0|B|0|E|3|1|0|0|0|5|2|6|8|3|0|Q|1|10|5|4|16|8|5|0|0^^$0|@$1|2|3|4|5|6|7|1A|8|@]|9|@$A|1B|B|1C|1|1D]|$A|1E|B|1F|1|1G]]|C|$]]|$1|D|3|E|5|F|7|1H|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1I|8|@]|9|@$A|1J|B|1K|1|1L]|$A|1M|B|1N|1|1O]]|C|$]]|$1|L|3|M|5|K|7|1P|8|@$A|1Q|B|1R|N|O]]|9|@$A|1S|B|1T|1|1U]|$A|1V|B|1W|1|1X]]|C|$]]|$1|P|3|Q|5|6|7|1Y|8|@]|9|@]|C|$]]|$1|R|3|S|5|F|7|1Z|8|@]|9|@]|C|$G|H]]]|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]]|14|$5|V|W|X|C|$Y|15]]|16|$5|V|W|X|C|$Y|17]]|18|$5|V|W|X|C|$Y|19]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E/wiki/Commands" rel="nofollow noreferrer">05AB1E (legacy)</a>, 9 <a href="https://github.com/Adriandmen/05AB1E/wiki/Codepage" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>di.bëÇ64-
</code></pre>
<p><a href="https://tio.run/##MzBNTDJM/f8/JVMv6fDqw@1mJrr//7sCAA" rel="nofollow noreferrer">Try it online</a> or <a href="https://tio.run/##MzBNTDJM/a/kVpSfa6WgZO9YGvyoqcnn0GpbLqWQfCsFBaDYua0u/1My9ZIOrz7cbmai@7@2Vuc/AA" rel="nofollow noreferrer">verify all test cases</a>.</p>
<p>Also works in the new version of 05AB1E instead of the legacy, but the <code>Ç</code> wraps in a list: <a href="https://tio.run/##yy9OTMpM/f8/JVMv6fDqw@1mJrr//7sCAA" rel="nofollow noreferrer">Try it online</a> or <a href="https://tio.run/##yy9OTMpM/a/kVpSfa6WgZO9YGvyoqcnn0GpbLqWQfCsFBaDYua0u/1My9ZIOrz7cbmai@7@2Vuc/AA" rel="nofollow noreferrer">verify all test cases</a>.</p>
<p><strong>Explanation:</strong></p>

<pre class="lang-python prettyprint-override"><code>di      # Legacy 05AB1E version: If the (implicit) input is an integer:
        # New 05AB1E version: If the (implicit) input is a positive (&gt;= 0) integer:
  .b    #  Builtin to convert the integer to its 1-based uppercase alphabetic letter
 ë      # Else:
  Ç     #  Get the codepoint of the uppercase letter
   64-  #  And subtract 64 to convert it to its 1-based index
        # (after which the result is output implicitly)
</code></pre>


blocks|key|6105310|text|朱莉娅1.0，22字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6105311|~a=a-'@'
~n::Int=n%2B'@'|code-block|syntax|javascript|6105312|在网上试试！|unstyled|6105313|这个解决方案涉及到一个两种方法的单函数。|entityMap|0|LINK|mutability|MUTABLE|url|http://julialang.org/|1|https://tio.run/##yyrNyUw0rPj/vy7RNlFX3UGdqy7Pysozr8Q2TxvI@@9QnJFfrpCbWKBRp2NoZWSmyYUsou6obqUepa75HwA|2|https://docs.julialang.org/en/v1/manual/methods/^0|0|6|0|0|0|0|6|1|0|B|8|2^^$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|@$A|18|B|19|1|1A]]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]|W|$5|P|Q|R|C|$S|X]]]]

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

<pre class="lang-julia prettyprint-override"><code>~a=a-'@'
~n::Int=n+'@'
</code></pre>
<p><a href="https://tio.run/##yyrNyUw0rPj/vy7RNlFX3UGdqy7Pysozr8Q2TxvI@@9QnJFfrpCbWKBRp2NoZWSmyYUsou6obqUepa75HwA" rel="nofollow noreferrer" title="Julia 1.0 – Try It Online">Try it online!</a></p>
<p>This solution involves a <a href="https://docs.julialang.org/en/v1/manual/methods/" rel="nofollow noreferrer">single function with 2 methods</a>.</p>


blocks|key|677829|text|R，75字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|677830|f=function(l,a=which(LETTERS==l))ifelse(length(a),a,LETTERS[as.numeric(l)])|code-block|syntax|javascript|677831|从技术上讲，这个函数有两个输入。但是第二个仅仅是因为通过默认设置a，我可以去掉2个字节。给函数一个引用的字母或数字，或者只是一个数字，它将返回相反的。|unstyled|offset|length|style|CODE|677832|说明：a测试它是否是一个字母以及它是哪个字母。如果不是的话，它会把相关的字母取出来。|entityMap^0|0|0|W|1|0|3|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]]|9|@]|A|$]]|$1|N|3|O|5|I|7|V|8|@$J|W|K|X|L|M]]|9|@]|A|$]]]|P|$]]

<h1>R, 75 bytes</h1>
<pre><code>f=function(l,a=which(LETTERS==l))ifelse(length(a),a,LETTERS[as.numeric(l)])
</code></pre>
<p>This function technically has two inputs. But the second one is merely there because by setting <code>a</code> through a default, I can get rid of 2 bytes. Give the function a quoted letter or number, or just a number, and it will return the opposite.</p>
<p>Explanation: <code>a</code> tests if it is a letter and which one it is. If it isn't it pulls the relevant letter.</p>


blocks|key|6104589|text|皮斯，13字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6104590|.xC%2B64sQhxr1G|code-block|syntax|javascript|6104591|测试套件。|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/isaacg1/pyth|1|http://pyth.herokuapp.com/?code=.xC%252B64sQhxr1G&test_suite=1&test_suite_input=%2522A%2522%250A%2522Z%2522%250A1%250A26&debug=0^0|0|2|0|0|0|0|5|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/isaacg1/pyth" rel="nofollow">Pyth</a>, 13 bytes</h1>

<pre><code>.xC+64sQhxr1G
</code></pre>

<p><a href="http://pyth.herokuapp.com/?code=.xC%2B64sQhxr1G&amp;test_suite=1&amp;test_suite_input=%22A%22%0A%22Z%22%0A1%0A26&amp;debug=0" rel="nofollow">Test suite.</a></p>


blocks|key|6104669|text|R，62+Bytes|type|header-two|depth|inlineStyleRanges|entityRanges|data|6104670|f=function(x)ifelse(is.finite(x),LETTERS[x],which(LETTERS==x))|code-block|syntax|javascript|6104671|接受输入x并检查它是否是有限的，这比在这种情况下检查它是否是数字和等效的要短一个字节。如果是，输出字母，如果没有，则输出字母表中与字符输入相等的位置。|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|$]]

<h1>R, 62 Bytes</h1>

<pre><code>f=function(x)ifelse(is.finite(x),LETTERS[x],which(LETTERS==x))
</code></pre>

<p>Takes the input <em>x</em> and checks if it is finite, which is one byte shorter than checking if it is numeric and equivalent in this case. If yes, output the letter, if no, output the position in the alphabet equal to the character input.</p>


blocks|key|678416|text|Dyalog+APL，14+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|678417|{0::⎕A⍳⍵
⍵⊃⎕A}|code-block|syntax|javascript|678418|如果发生错误，则为0::：|unstyled|style|CODE|678419|678420|⎕A⍳⍵返回字母表中参数的索引|678421|⍵⊃⎕A使用参数从字母表中选择一个元素(如果参数是字符，则出错)|678422|TryAPL在线！|entityMap|0|LINK|mutability|MUTABLE|url|http://goo.gl/9KrKoM|1|http://meta.codegolf.stackexchange.com/a/9429/43319|2|http://tryapl.org/?a=f%25u2190%257B0%253A%253A%25u2395A%25u2373%25u2375%25u22C4%25u2375%25u2283%25u2395A%257D%2520%25u22C4%2520f%25A81%25202%252026%2520%2527A%2527%2520%2527B%2527%2520%2527Z%2527&run^0|0|A|0|E|3|1|0|0|9|3|0|0|0|4|0|0|4|0|0|9|2^^$0|@$1|2|3|4|5|6|7|15|8|@]|9|@$A|16|B|17|1|18]|$A|19|B|1A|1|1B]]|C|$]]|$1|D|3|E|5|F|7|1C|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1D|8|@$A|1E|B|1F|L|M]]|9|@]|C|$]]|$1|N|3|-4|5|K|7|1G|8|@]|9|@]|C|$]]|$1|O|3|P|5|K|7|1H|8|@$A|1I|B|1J|L|M]]|9|@]|C|$]]|$1|Q|3|R|5|K|7|1K|8|@$A|1L|B|1M|L|M]]|9|@]|C|$]]|$1|S|3|T|5|K|7|1N|8|@]|9|@$A|1O|B|1P|1|1Q]]|C|$]]]|U|$V|$5|W|X|Y|C|$Z|10]]|11|$5|W|X|Y|C|$Z|12]]|13|$5|W|X|Y|C|$Z|14]]]]

<h1><a href="http://goo.gl/9KrKoM" rel="nofollow noreferrer">Dyalog APL</a>, 14 <a href="http://meta.codegolf.stackexchange.com/a/9429/43319">bytes</a></h1>

<pre class="lang-apl prettyprint-override"><code>{0::⎕A⍳⍵
⍵⊃⎕A}
</code></pre>
<p><code>0::</code> if any error happens:<br>
 <code>⎕A⍳⍵</code> return the index of the argument in the alphabet</p>
<p><code>⍵⊃⎕A</code> use the argument to pick an element from the alphabet (errors if the argument is character)</p>
<p><a href="http://tryapl.org/?a=f%u2190%7B0%3A%3A%u2395A%u2373%u2375%u22C4%u2375%u2283%u2395A%7D%20%u22C4%20f%A81%202%2026%20%27A%27%20%27B%27%20%27Z%27&amp;run" rel="nofollow noreferrer">TryAPL online!</a></p>


blocks|key|678575|text|SQF，72字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|678576|使用作为文件的函数格式：|unstyled|678577|i=_this;if((str+i)==i)then{toString[i%2B64]}else{((toArray+i)select+0)-64}|code-block|syntax|javascript|678578|呼叫as：ARG+call+NAME_OF_COMPILED_FUNCTION|offset|length|style|CODE|entityMap^0|0|0|0|5|Y^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|R|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|S|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|T|8|@$L|U|M|V|N|O]]|9|@]|A|$]]]|P|$]]

<h1>SQF, 72 bytes</h1>

<p>Using the function-as-a-file format:</p>

<pre><code>i=_this;if((str i)==i)then{toString[i+64]}else{((toArray i)select 0)-64}
</code></pre>

<p>Call as: <code>ARG call NAME_OF_COMPILED_FUNCTION</code></p>


blocks|key|6104968|text|JavaScript，41字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6104969|x=>-x?(9%2Bx).toString(36):parseInt(x,36)-9|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|$]]

<h1>JavaScript, 41 bytes</h1>
<pre class="lang-js prettyprint-override"><code>x=&gt;-x?(9+x).toString(36):parseInt(x,36)-9
</code></pre>


blocks|key|6105048|text|球拍58字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6105049|(if(char?+i)(-(char->integer+i)64)(integer->char(%2B+64+i)))|code-block|syntax|javascript|6105050|未高尔夫球：|unstyled|6105051|(define+(f+i)
++(if+(char?+i)
++++++(-(char->integer+i)+64)
++++++(integer->char+(%2B+64+i))))|6105052|测试：|6105053|(f+1)
(f+3)
(f+#\A)
(f+#\D)|6105054|输出：|6105055|#\A
#\C
1
4|entityMap^0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|W|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|Y|8|@]|9|@]|A|$]]|$1|N|3|O|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|P|3|Q|5|I|7|10|8|@]|9|@]|A|$]]|$1|R|3|S|5|D|7|11|8|@]|9|@]|A|$E|F]]]|T|$]]

<h2>Racket 58 bytes</h2>

<pre><code>(if(char? i)(-(char-&gt;integer i)64)(integer-&gt;char(+ 64 i)))
</code></pre>

<p>Ungolfed: </p>

<pre><code>(define (f i)
  (if (char? i)
      (-(char-&gt;integer i) 64)
      (integer-&gt;char (+ 64 i))))
</code></pre>

<p>Testing:</p>

<pre><code>(f 1)
(f 3)
(f #\A)
(f #\D)
</code></pre>

<p>Output: </p>

<pre><code>#\A
#\C
1
4
</code></pre>


blocks|key|6105101|text|破折号，33字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6105102|@[="num"type#0?fc+%2B64#0?-(tc#0)64|code-block|syntax|javascript|6105103|喔-呼，第一个PPCG回答用我的新的函数式编程语言！|unstyled|6105104|安装和其他信息都在Github上。|6105105|使用|6105106|(@[="num"type#0?fc+%2B64#0?-(tc#0)64])"A"++#.+strings
(@[="num"type#0?fc+%2B64#0?-(tc#0)64])26+++#.+numbers|6105107|解释|6105108|@++++++++++++++++++++++#.+lambda
++[++++++++++++++++++++#.+start+of+conditional+block
++++=+"num"+(type+#0)++#.+check+if+argument+is+a+number
++++++?+fc+(%2B+64+#0)+++#.+if+so,+add+64+to+argument+and+convert+from+charcode
++++++?+-+(tc+#0)+64+++#.+otherwise,+convert+argument+to+charcode+and+subtract+64
+++++++++++++++++++++++#.+we+can+actually+leave+off+the+closing+bracket+for+now|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/molarmanful/DASH^0|0|3|0|0|0|0|0|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|@]|C|$]]|$1|L|3|M|5|K|7|18|8|@]|9|@]|C|$]]|$1|N|3|O|5|6|7|19|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1A|8|@]|9|@]|C|$G|H]]|$1|R|3|S|5|6|7|1B|8|@]|9|@]|C|$]]|$1|T|3|U|5|F|7|1C|8|@]|9|@]|C|$G|H]]]|V|$W|$5|X|Y|Z|C|$10|11]]]]

<h1><a href="https://github.com/molarmanful/DASH" rel="nofollow noreferrer">DASH</a>, 33 bytes</h1>
<pre><code>@[=&quot;num&quot;type#0?fc +64#0?-(tc#0)64
</code></pre>
<p>Woo-hoo, first PPCG answer in my new functional programming language!</p>
<p>Installation and other info is all on the Github.</p>
<h1>Usage</h1>
<pre><code>(@[=&quot;num&quot;type#0?fc +64#0?-(tc#0)64])&quot;A&quot;  #. strings
(@[=&quot;num&quot;type#0?fc +64#0?-(tc#0)64])26   #. numbers
</code></pre>
<h1>Explanation</h1>
<pre><code>@                      #. lambda
  [                    #. start of conditional block
    = &quot;num&quot; (type #0)  #. check if argument is a number
      ? fc (+ 64 #0)   #. if so, add 64 to argument and convert from charcode
      ? - (tc #0) 64   #. otherwise, convert argument to charcode and subtract 64
                       #. we can actually leave off the closing bracket for now
</code></pre>


blocks|key|678700|text|C%2B%2B+(gcc)，27字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|678701|作为未命名的泛型lambda，接受char或int并通过引用参数(input=output)返回|unstyled|style|CODE|678702|[](auto&r){r%2B=r<64?64:-64;}|code-block|syntax|javascript|678703|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://gcc.gnu.org/|1|https://tio.run/##lY1NCoMwEIX3OcVgoSrWRYu4aGJLr9HSRRhjG9AoMYIgnj2dWOi@m3lvft43OAz5C9HvtMF2qpXQ/eiskt2FMTm5HprKP55JsHubLjarrCiLa1mc87Lgq@eMTaM2LzCyU@MgUcHoappq46CT2iTpwqDpbYJvaQGhgvgWczKC3J1clmE4gRCYaY2cmiaZ06DYTw6EoAWV6AARBwYr@82VqVv@5Ye8pvyRkxD8VAa23tjb7wDX/8PZ6j8^0|0|9|0|0|H|4|M|3|0|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|@$A|13|B|14|G|H]|$A|15|B|16|G|H]]|9|@]|C|$]]|$1|I|3|J|5|K|7|17|8|@]|9|@]|C|$L|M]]|$1|N|3|O|5|F|7|18|8|@]|9|@$A|19|B|1A|1|1B]]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://gcc.gnu.org/" rel="nofollow noreferrer">C++ (gcc)</a>, 27 bytes</h1>



<p>As unnamed generic lambda, accepting <code>char</code> or <code>int</code> and returning via reference parameter (input=output)</p>

<pre class="lang-cpp prettyprint-override"><code>[](auto&amp;r){r+=r&lt;64?64:-64;}
</code></pre>

<p><a href="https://tio.run/##lY1NCoMwEIX3OcVgoSrWRYu4aGJLr9HSRRhjG9AoMYIgnj2dWOi@m3lvft43OAz5C9HvtMF2qpXQ/eiskt2FMTm5HprKP55JsHubLjarrCiLa1mc87Lgq@eMTaM2LzCyU@MgUcHoappq46CT2iTpwqDpbYJvaQGhgvgWczKC3J1clmE4gRCYaY2cmiaZ06DYTw6EoAWV6AARBwYr@82VqVv@5Ye8pvyRkxD8VAa23tjb7wDX/8PZ6j8" rel="nofollow noreferrer" title="C++ (gcc) – Try It Online">Try it online!</a></p>


blocks|key|678923|text|斯塔克斯，15+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|678924|Ö└╝╨→ε/óo↕[▄╢▐W|code-block|syntax|javascript|678925|运行并调试它|unstyled|678926|这个包解压缩到以下18个字节：|678927|cc%25!{64%2Bz%2B}{E64-}?|678928|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=99c0bcd01aee2fa26f125bdcb6de57&i=A%250A1%250AZ%250A26&m=2|3|https://staxlang.xyz/#c=cc%2525%2521%257B64%252Bz%252B%257D%257BE64-%257D%253F&i=A%250A1%250AZ%250A26&m=2^0|0|4|0|8|3|1|0|0|0|6|2|0|0|0|0|6|3^^$0|@$1|2|3|4|5|6|7|13|8|@]|9|@$A|14|B|15|1|16]|$A|17|B|18|1|19]]|C|$]]|$1|D|3|E|5|F|7|1A|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1B|8|@]|9|@$A|1C|B|1D|1|1E]]|C|$]]|$1|L|3|M|5|K|7|1F|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1G|8|@]|9|@]|C|$G|H]]|$1|P|3|J|5|K|7|1H|8|@]|9|@$A|1I|B|1J|1|1K]]|C|$]]]|Q|$R|$5|S|T|U|C|$V|W]]|X|$5|S|T|U|C|$V|Y]]|Z|$5|S|T|U|C|$V|10]]|11|$5|S|T|U|C|$V|12]]]]

<h1><a href="https://github.com/tomtheisen/stax" rel="nofollow noreferrer">Stax</a>, 15 <a href="https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>Ö└╝╨→ε/óo↕[▄╢▐W
</code></pre>
<p><a href="https://staxlang.xyz/#p=99c0bcd01aee2fa26f125bdcb6de57&amp;i=A%0A1%0AZ%0A26&amp;m=2" rel="nofollow noreferrer">Run and debug it</a></p>
<p>This unpacks to the following 18 bytes:</p>
<pre><code>cc%!{64+z+}{E64-}?
</code></pre>
<p><a href="https://staxlang.xyz/#c=cc%25%21%7B64%2Bz%2B%7D%7BE64-%7D%3F&amp;i=A%0A1%0AZ%0A26&amp;m=2" rel="nofollow noreferrer">Run and debug it</a></p>


<h1>Challenge</h1>

<p>In this challenge you have to take a number as input and output the corresponding letter of the alphabet, and vice versa. (1 &lt;=> A, 2 &lt;=> B) etc.</p>

<pre><code>1 -&gt; A
2 -&gt; B
...
26 -&gt; Z

A -&gt; 1
B -&gt; 2
...
Z -&gt; 26
</code></pre>

<h1>Rules</h1>

<ul>
<li>This is <a href="/questions/tagged/code-golf" class="post-tag" title="show questions tagged &#39;code-golf&#39;" rel="tag">code-golf</a>, so shortest code in bytes wins.</li>
<li>The input will only consist of either an uppercase letter from <code>A</code> to <code>Z</code> or an integer from <code>1</code> to <code>26</code> inclusive.</li>
<li>Trailing whitespaces (space and newline) are allowed.</li>
</ul>


Alphabet to Number and Number to Alphabet

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

挑战在这个挑战中，你必须以一个数字作为输入，输出相应的字母，反之亦然。(1 <=> A，2 <=> B)等。1 -> A2 -> B...26 -> ZA -> 1B -> 2...Z -> 26规则这是密码-高尔夫，所以以字节为单位的最短代码将获胜。输入将只包含从A到Z的大写字母或从1到26的整数。允许尾随空格(空格和换行符)。

问字母表为数字，数字为字母
EN

挑战

规则

回答 32

Code Golf用户

实际上是7字节

Code Golf用户

Erlang，26字节

Code Golf用户

Python2，38个字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问字母表为数字，数字为字母EN

挑战

规则

回答 32

Code Golf用户

实际上是7字节

Code Golf用户

Erlang，26字节

Code Golf用户

Python2，38个字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问字母表为数字，数字为字母
EN