blocks|key|5140079|text|Python-92|type|header-two|depth|inlineStyleRanges|entityRanges|data|5140080|这里是我的尝试，这主要是我在发布这个问题之前所做的，尽管出于某种原因，我使用的是文字空间，而不是逗号。|unstyled|5140081|from+itertools+import*
r=raw_input
r()
for+k,g+in+groupby(r().split()):print+len(list(g)),k,|code-block|syntax|javascript|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|$]]|$1|E|3|F|5|G|7|M|8|@]|9|@]|A|$H|I]]]|J|$]]

<h2>Python - 92</h2>

<p>Here's my attempt, which is mostly what I had before I posted this question, though for some reason I used a literal space instead of a comma.</p>

<pre><code>from itertools import*
r=raw_input
r()
for k,g in groupby(r().split()):print len(list(g)),k,
</code></pre>


blocks|key|6327610|text|Scala-136|type|header-two|depth|inlineStyleRanges|entityRanges|data|6327611|def+f(s:Seq[_]):String=if(s.isEmpty)""else{val(l,r)=s.span(s.head==);l.size%2B"+"%2Bs.head%2B"+"%2Bf(r)}
readLine
println(f(readLine+split'+'))|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>Scala - 136</h1>

<pre><code>def f(s:Seq[_]):String=if(s.isEmpty)""else{val(l,r)=s.span(s.head==);l.size+" "+s.head+" "+f(r)}
readLine
println(f(readLine split' '))
</code></pre>


blocks|key|6327774|text|Scala+-101个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|6327775|这是基于regex解决方案的。实际上，我不知道这在Java中是有效的正则表达式！(Scala的regex是基于Java的)|unstyled|6327776|print("(\\d%2B)(+\\1)*".r.replaceAllIn({readLine;readLine},m=>(m.matched+split'+'size)%2B"+"%2Bm.group(1)))|code-block|syntax|javascript|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|$]]|$1|E|3|F|5|G|7|M|8|@]|9|@]|A|$H|I]]]|J|$]]

<h1>Scala - 101 characters</h1>

<p>This is based on the regex solution. I didn't know this was valid regex in Java, actually! (Scala's regex is based on Java's)</p>

<pre><code>print("(\\d+)( \\1)*".r.replaceAllIn({readLine;readLine},m=&gt;(m.matched split' 'size)+" "+m.group(1)))
</code></pre>


blocks|key|6327885|text|R，33字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6327886|迟答..。|unstyled|6327887|cat(t(mapply(c,rle(scan()[-1]))))|code-block|syntax|javascript|6327888|不毛之地|6327889|scan()[-1]++++++#+read+in+from+stdin+[-1]+drops+first+element
rle(..)+++++++++#+perform+run+length+encoding+(return+list+with+lengths+and+values)
mapply(c,+list)+#+converts+list+to+matrix
t()+++++++++++++#+transposes+this+matrix+so+when+extracted+as+a+vector+is+length+value+...
cat()+++++++++++#+writes+to+stdout+(separated+by+space)|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>R, 33 bytes</h1>

<p>Late answer....</p>

<pre><code>cat(t(mapply(c,rle(scan()[-1]))))
</code></pre>

<p>Ungolfed</p>

<pre><code>scan()[-1]      # read in from stdin [-1] drops first element
rle(..)         # perform run length encoding (return list with lengths and values)
mapply(c, list) # converts list to matrix
t()             # transposes this matrix so when extracted as a vector is length value ...
cat()           # writes to stdout (separated by space)
</code></pre>


blocks|key|5139844|text|Python-106个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|5139845|概念上很简单，但是一些非常昂贵的词却把它压垮了。|unstyled|5139846|from+itertools+import*
input()
print"+".join(`len(list(j))`%2B'+'%2Bi+for+i,j+in+groupby(raw_input().split()))|code-block|syntax|javascript|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|$]]|$1|E|3|F|5|G|7|M|8|@]|9|@]|A|$H|I]]]|J|$]]

<h2>Python - 106 chars</h2>

<p>Very simple conceptually, but some very expensive words weigh it down</p>

<pre><code>from itertools import*
input()
print" ".join(`len(list(j))`+' '+i for i,j in groupby(raw_input().split()))
</code></pre>


blocks|key|5139889|text|C+101个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|5139890|#define+p+printf("%25d+%25d+",c,l)
main(c,i,l){gets(&i);for(c=0;~scanf("%25d",&i);l=i)i!=l&&c?p,c=1:c%2B%2B;p;}|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|$]]

<p><strong>C 101 Characters</strong></p>

<pre><code>#define p printf("%d %d ",c,l)
main(c,i,l){gets(&amp;i);for(c=0;~scanf("%d",&amp;i);l=i)i!=l&amp;&amp;c?p,c=1:c++;p;}
</code></pre>


blocks|key|6327255|text|Python100个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|6327256|c=l=0
input()
for+i+in+raw_input().split():
+if+i!=l+and+c:print+c,l,;c=1
+else:c=c%2B1
+l=i
print+c,l|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|$]]

<p><strong>Python 100 Characters</strong></p>

<pre><code>c=l=0
input()
for i in raw_input().split():
 if i!=l and c:print c,l,;c=1
 else:c=c+1
 l=i
print c,l
</code></pre>


blocks|key|5140029|text|Python-110个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|5140030|import+re;R=raw_input;R()
print"+".join(`len(x[0].split())`%2B'+'%2Bx[1]for+x+in+re.findall(r"((\d%2B)(+\2)*)",R()))|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>Python - 110 chars</h2>

<pre><code>import re;R=raw_input;R()
print" ".join(`len(x[0].split())`+' '+x[1]for x in re.findall(r"((\d+)( \2)*)",R()))
</code></pre>


blocks|key|6327921|text|CJam，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6327922|l;l~]e`e_S*|code-block|syntax|javascript|6327923|CJam解释器在线+(+这注释提供的测试用例)。|unstyled|offset|length|6327924|解释：|6327925|l;l~]e`e_S*
l+++++++++++Get+input+line
+;++++++++++Remove+ToS
++l+++++++++Get+input+line
+++~++++++++Evaluate+code
++++]+++++++Wrap+the+stack+in+an+array+(from+[-mark)
+++++e`+++++Run-length+encode
+++++++e_+++Flatten
+++++++++S++Space+('+')
++++++++++*+Join|entityMap|0|LINK|mutability|MUTABLE|url|http://cjam.aditsu.net/#code=l%253Bl%257E%255De%2560e_S*&input=36%250A1%25201%25201%25201%25201%25201%25203%25203%25203%25203%25203%25202%25202%25207%25207%25207%25207%25204%25204%25209%25209%25209%25209%25209%25209%25209%25209%25209%25204%25204%25208%25203%25203%25203%25203%25200|1|https://codegolf.stackexchange.com/questions/1015/run-length-encoding^0|0|0|0|9|0|C|1|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|10|8|@]|9|@$J|11|K|12|1|13]|$J|14|K|15|1|16]]|A|$]]|$1|L|3|M|5|I|7|17|8|@]|9|@]|A|$]]|$1|N|3|O|5|D|7|18|8|@]|9|@]|A|$E|F]]]|P|$Q|$5|R|S|T|A|$U|V]]|W|$5|R|S|T|A|$U|X]]]]

<h1>CJam, 11 bytes</h1>
<pre><code>l;l~]e`e_S*
</code></pre>
<p><a href="http://cjam.aditsu.net/#code=l%3Bl%7E%5De%60e_S*&amp;input=36%0A1%201%201%201%201%201%203%203%203%203%203%202%202%207%207%207%207%204%204%209%209%209%209%209%209%209%209%209%204%204%208%203%203%203%203%200" rel="nofollow noreferrer">CJam interpreter online</a> (test case provided by <a href="/questions/1015/run-length-encoding#comment6753_1015">this</a> comment).</p>
<p>Explanation:</p>
<pre><code>l;l~]e`e_S*
l           Get input line
 ;          Remove ToS
  l         Get input line
   ~        Evaluate code
    ]       Wrap the stack in an array (from [-mark)
     e`     Run-length encode
       e_   Flatten
         S  Space (' ')
          * Join
</code></pre>


blocks|key|6327685|text|Scala+-141个字符|type|header-two|depth|inlineStyleRanges|entityRanges|data|6327686|纯函数式scala解决方案。我在这里使用两个黑客(开始和结束标记=+"a“)，必须在结尾处切断它们:()|unstyled|6327687|"a“是程序参数。|6327688|完整的工作代码是|6327689|package+hstar.randomstuff

import+tools.nsc.io.File

/**
+*+Developed+with+pleasure+:)<br>
+*+User:+HoD<br>
+*+Date:+28.07.11<br>
+*+Time:+19:37<br>
+*/

object+RLEEncoder+{
++def+main(a:+Array[String])+{
+++print(((0,"","")/:(File(a(0)).lines.toSeq(1).split('+'):%2B"a"))((a,c)=>if(a._2!=c)(0,c,a._3%2B'+'%2Ba._1%2B'+'%2Ba._2)else(a._1%2B1,c,a._3))._3.drop(4))
++}
}|code-block|syntax|javascript|6327690|实际逻辑是|6327691|print(((0,"","")/:(File(a(0)).lines.toSeq(1).split('+'):%2B"a"))((a,c)=>if(a._2!=c)(0,c,a._3%2B'+'%2Ba._1%2B'+'%2Ba._2)else(a._1%2B1,c,a._3))._3.drop(4))|entityMap^0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$]]|$1|E|3|F|5|D|7|U|8|@]|9|@]|A|$]]|$1|G|3|H|5|D|7|V|8|@]|9|@]|A|$]]|$1|I|3|J|5|K|7|W|8|@]|9|@]|A|$L|M]]|$1|N|3|O|5|D|7|X|8|@]|9|@]|A|$]]|$1|P|3|Q|5|K|7|Y|8|@]|9|@]|A|$L|M]]]|R|$]]

<h1>Scala - 141 chars</h1>
<p>a purely functional scala solution. i am using 2 hacks here (beginning and end markers = &quot;a&quot;, have to cut them off at the end :()</p>
<p>&quot;a&quot; is the program parameter</p>
<p>the full working code is</p>
<pre><code>package hstar.randomstuff

import tools.nsc.io.File

/**
 * Developed with pleasure :)&lt;br&gt;
 * User: HoD&lt;br&gt;
 * Date: 28.07.11&lt;br&gt;
 * Time: 19:37&lt;br&gt;
 */

object RLEEncoder {
  def main(a: Array[String]) {
   print(((0,&quot;&quot;,&quot;&quot;)/:(File(a(0)).lines.toSeq(1).split(' '):+&quot;a&quot;))((a,c)=&gt;if(a._2!=c)(0,c,a._3+' '+a._1+' '+a._2)else(a._1+1,c,a._3))._3.drop(4))
  }
}
</code></pre>
<p>the actual logic is</p>
<pre><code>print(((0,&quot;&quot;,&quot;&quot;)/:(File(a(0)).lines.toSeq(1).split(' '):+&quot;a&quot;))((a,c)=&gt;if(a._2!=c)(0,c,a._3+' '+a._1+' '+a._2)else(a._1+1,c,a._3))._3.drop(4))
</code></pre>


blocks|key|5140691|text|JavaScript，126个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5140692|(x,j=0)=>(x=x.split`+`).reduce((a,v,i)=>(v!=x[i-1]?(a[%2B%2Bj]=[]):a[j]).push(v)&&a,[]).reduce((a,v)=>a%2Bv.length%2B"+"%2Bv[0]%2B"+"+,"")|code-block|syntax|javascript|5140693|我猜这个可以进一步减少，但我很高兴它能起作用。|unstyled|5140694|首先，我根据空间进行拆分，然后将数组从1,1,1,2,2,3,3转换为表示每次运行的一系列数组[1,1,1、2,2、3,3]，然后再将其简化为生成所需的输出"3+1+2+2+2+3“。|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|I|7|P|8|@]|9|@]|A|$]]]|L|$]]

<h1>JavaScript, 126 bytes</h1>

<pre><code>(x,j=0)=&gt;(x=x.split` `).reduce((a,v,i)=&gt;(v!=x[i-1]?(a[++j]=[]):a[j]).push(v)&amp;&amp;a,[]).reduce((a,v)=&gt;a+v.length+" "+v[0]+" " ,"")
</code></pre>

<p>I'm guessing this can be reduced further, but I'm just happy it works.</p>

<p>First I split based on the space, then I convert the array from [1,1,1,2,2,3,3] to a series of array representing each run [[1,1,1],[2,2],[3,3]], then I reduce that again to produce the required output of "3 1 2 2 2 3".</p>


blocks|key|5140720|text|叠加，非竞争，34个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|5140721|([prompt]2*eval)behead+flatrle+out|code-block|syntax|javascript|5140722|严格按照IO格式确认。在这里试试！|unstyled|offset|length|5140723|或者，我们可以使用内置的7个字节：flatrle+(或$flatrle)。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://conorobrien-foxx.github.io/stacked/stacked.html^0|0|0|B|6|0|0|H|7|R|8^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Y|8|@]|9|@$J|Z|K|10|1|11]]|A|$]]|$1|L|3|M|5|I|7|12|8|@$J|13|K|14|N|O]|$J|15|K|16|N|O]]|9|@]|A|$]]]|P|$Q|$5|R|S|T|A|$U|V]]]]

<h1>Stacked, noncompeting, 34 bytes</h1>

<pre><code>([prompt]2*eval)behead flatrle out
</code></pre>

<p>Confirms strictly with the IO format. <a href="https://conorobrien-foxx.github.io/stacked/stacked.html" rel="nofollow noreferrer">Try it here!</a></p>

<p>Or, we can use the builtin for 7 bytes: <code>flatrle</code> (or <code>$flatrle</code>).</p>


<p>Write a program uses <a href="http://en.wikipedia.org/wiki/Run-length_encoding">run-length encoding</a> to shorten a list of non-negative integers it has to read in.</p>

<p>You can assume the non-negative integers can fit in 32bit signed integers.</p>

<p><strong>Input Format</strong></p>

<p>The length, <code>n</code>, of the list on the first line.</p>

<p>On the second line, a space-separated list of integers representing the list of integers.</p>

<p><strong>Output Format</strong></p>

<p>A space separated list of integers. The first 2 integers represent the first run, the next 2 integers the second run and so on. For each pair of integers representing a run, the first integer represents the length of the run and the second represents the value of the integer in the run.</p>

<p><strong>Sample Input</strong></p>

<p>1.</p>

<pre><code>5
1 1 3 2 2
</code></pre>

<p>2.</p>

<pre><code>3
1 1 1
</code></pre>

<p><strong>Sample Output</strong></p>

<p>1.</p>

<pre><code>2 1 1 3 2 2
</code></pre>

<p>2.</p>

<pre><code>3 1
</code></pre>

<p><strong>Limits</strong></p>

<pre><code>0&lt;n&lt;10000
</code></pre>


Run-Length Encoding

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

编写一个程序，使用游程编码来缩短它必须读取的非负整数的列表。您可以假设非负整数可以适合32位有符号整数。输入格式第一行列表的长度( n )。在第二行，表示整数列表的空格分隔的整数列表.输出格式空格分隔的整数列表。前两个整数代表第一次运行，接下来的两个整数表示第二次运行，依此类推。对于代表运行的每一对整数，第一个整数表示运行的长度，第二个表示运行中整数的值。样本输入1.51 1 3 2 22.31 

问游程编码
EN

输入格式

输出格式

样本输入

样本输出

限制

回答 12

Code Golf用户

Python-92

Code Golf用户

Scala-136

Code Golf用户

Scala -101个字符

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问游程编码EN

输入格式

输出格式

样本输入

样本输出

限制

回答 12

Code Golf用户

Python-92

Code Golf用户

Scala-136

Code Golf用户

Scala -101个字符

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问游程编码
EN