blocks|key|3153964|text|你能把二进制转换成字符串吗？|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3153965|假设你可以，那么像下面这样做：|3153966|B+=+"1011011101111011111",
S+=+string:tokens(B,+"0"),
R+=+lists:map(fun(E)->length(E)+end,+S).|code-block|syntax|javascript|3153967|但这并不是很有效。期待好的答案。|3153968|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|N|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|O|8|@]|9|@]|A|$G|H]]|$1|I|3|J|5|6|7|P|8|@]|9|@]|A|$]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

Can you convert binary to string?

Suppose you can, then do like following:

<pre><code>B = "1011011101111011111",
S = string:tokens(B, "0"),
R = lists:map(fun(E)-&gt;length(E) end, S).
</code></pre>

But this is not efficient. Expect good answer.

blocks|key|2673237|text|下面是解析header的方法：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2673238|-module(bitcnt).
-export([parse_header/1]).

parse_header(Message)+->
++++++++parse_header(Message,+[]).

parse_header(<<0:1,+0:1,+Body/bitstring>>,+Header)+->
++++++++%25%25+stop+if+found+header+delimiter+-+two+consecutive+zero+bits
++++++++%25%25+return+parsed+header+and+message+body
++++++++{lists:reverse(Header),+Body};
parse_header(<<1:1,+Rest/bitstring>>,+[])+->
++++++++%25%25+handle+if+first+bit+is+'1'
++++++++parse_header(Rest,+[1]);
parse_header(<<1:1,+Rest/bitstring>>,+[H+%7C+T])+->
++++++++%25%25+handle+consecutive+'1'+bits+of+header
++++++++parse_header(Rest,+[H%2B1+%7C+T]);
parse_header(<<0:1,+Rest/bitstring>>,+Header)+->
++++++++%25%25+handle+delimiters+inside+header+-+'0'+bit
++++++++parse_header(Rest,+[0+%7C+Header]).|code-block|syntax|javascript|2673239|让我们在shell中测试它。假设标题'10110111‘(必须解析为1,2,3)+%2B分隔符'00’%2B某个正文<<12345:64>>：|2673240|2>+B1+=+<<1:1,0:1,1:1,1:1,0:1,1:1,1:1,1:1,0:1,0:1,12345:64>>.
<<183,0,0,0,0,0,0,12,14,1:2>>
3>+
3>+bitcnt:parse_header(B1).
{[1,2,3],<<0,0,0,0,0,0,48,57>>}
4>+
4>+<<12345:64>>.
<<0,0,0,0,0,0,48,57>>|2673241|另一个测试'11101‘(必须解析为3,1)+%2B+'00’%2B+<<12345:64>>|2673242|5>+B2+=+<<1:1,+1:1,+1:1,+0:1,+1:1,+0:1,+0:1,+12345:64>>.
<<232,0,0,0,0,0,0,96,57:7>>
6>+
6>+bitcnt:parse_header(B2).+++++++++++++++++++++++++++++
{[3,1],<<0,0,0,0,0,0,48,57>>}|2673243|即使报头为空(消息以两个连续的0比特开始)-函数将报头解析为空列表：|2673244|7>+B3+=+<<0:1,+0:1,+12345:64>>.
<<0,0,0,0,0,0,12,14,1:2>>
8>+
8>+bitcnt:parse_header(B3).++++
{[],<<0,0,0,0,0,0,48,57>>}|2673245|P.S.|offset|length|style|BOLD|2673246|顺便说一句，你的报头的格式是非常冗余的。如果你想编码大数字，例如，数字1024+-你需要把它转换成1024个连续的'1‘位！|2673247|有两种方法可以改进标头的格式：|2673248|2673249|如果您知道您的任何数字小于某个阈值数字:计算您需要对具有最大值的数字进行编码的位数，并使用预定义长度的位串对报头中的每个数字进行编码。例如，如果你所有的数字都小于2%5E32，你需要32位来对这个区间中的每个数字进行编码，如果你不能定义阈值(具有最大值的数字)：|unordered-list-item|2673250|+variable+length+|2673251|。例如，Elias+gamma-coding或Exponential-Golomb+coding.|2673252|2673253|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Elias_gamma_coding|1|http://en.wikipedia.org/wiki/Exponential-Golomb_coding^0|0|0|0|0|0|0|0|0|0|4|0|B|8|0|0|F|0|0|1S|1T|0|0|H|0|0|1D|4|I|0|N|P|1|0|0^^$0|@$1|2|3|4|5|6|7|1L|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|1M|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|1N|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|1O|8|@]|9|@]|A|$E|F]]|$1|K|3|L|5|6|7|1P|8|@]|9|@]|A|$]]|$1|M|3|N|5|D|7|1Q|8|@]|9|@]|A|$E|F]]|$1|O|3|P|5|6|7|1R|8|@]|9|@]|A|$]]|$1|Q|3|R|5|D|7|1S|8|@]|9|@]|A|$E|F]]|$1|S|3|T|5|6|7|1T|8|@$U|1U|V|1V|W|X]]|9|@]|A|$]]|$1|Y|3|Z|5|6|7|1W|8|@$U|1X|V|1Y|W|X]]|9|@]|A|$]]|$1|10|3|11|5|6|7|1Z|8|@$U|20|V|21|W|X]]|9|@]|A|$]]|$1|12|3|-4|5|6|7|22|8|@]|9|@]|A|$]]|$1|13|3|14|5|15|7|23|8|@$U|24|V|25|W|X]]|9|@]|A|$]]|$1|16|3|17|5|6|7|26|8|@$U|27|V|28|W|X]]|9|@]|A|$]]|$1|18|3|19|5|15|7|29|8|@$U|2A|V|2B|W|X]]|9|@$U|2C|V|2D|1|2E]|$U|2F|V|2G|1|2H]]|A|$]]|$1|1A|3|-4|5|6|7|2I|8|@]|9|@]|A|$]]|$1|1B|3|-4|5|6|7|2J|8|@]|9|@]|A|$]]]|1C|$1D|$5|1E|1F|1G|A|$1H|1I]]|1J|$5|1E|1F|1G|A|$1H|1K]]]]

Here is how you can parse header:

<pre class="lang-eralng prettyprint-override"><code>-module(bitcnt).
-export([parse_header/1]).

parse_header(Message) -&gt;
 parse_header(Message, []).

parse_header(&lt;&lt;0:1, 0:1, Body/bitstring&gt;&gt;, Header) -&gt;
 %% stop if found header delimiter - two consecutive zero bits
 %% return parsed header and message body
 {lists:reverse(Header), Body};
parse_header(&lt;&lt;1:1, Rest/bitstring&gt;&gt;, []) -&gt;
 %% handle if first bit is '1'
 parse_header(Rest, [1]);
parse_header(&lt;&lt;1:1, Rest/bitstring&gt;&gt;, [H | T]) -&gt;
 %% handle consecutive '1' bits of header
 parse_header(Rest, [H+1 | T]);
parse_header(&lt;&lt;0:1, Rest/bitstring&gt;&gt;, Header) -&gt;
 %% handle delimiters inside header - '0' bit
 parse_header(Rest, [0 | Header]).
</code></pre>

Let test it in shell. Assume such header '10110111' (must be parsed into [1,2,3]) + delimiter '00' + some body &lt;&lt;12345:64>>:

<pre class="lang-eralng prettyprint-override"><code>2&gt; B1 = &lt;&lt;1:1,0:1,1:1,1:1,0:1,1:1,1:1,1:1,0:1,0:1,12345:64&gt;&gt;.
&lt;&lt;183,0,0,0,0,0,0,12,14,1:2&gt;&gt;
3&gt; 
3&gt; bitcnt:parse_header(B1).
{[1,2,3],&lt;&lt;0,0,0,0,0,0,48,57&gt;&gt;}
4&gt; 
4&gt; &lt;&lt;12345:64&gt;&gt;.
&lt;&lt;0,0,0,0,0,0,48,57&gt;&gt;
</code></pre>

Another test '11101' (must be parsed into [3,1]) + '00' + &lt;&lt;12345:64>>

<pre class="lang-eralng prettyprint-override"><code>5&gt; B2 = &lt;&lt;1:1, 1:1, 1:1, 0:1, 1:1, 0:1, 0:1, 12345:64&gt;&gt;.
&lt;&lt;232,0,0,0,0,0,0,96,57:7&gt;&gt;
6&gt; 
6&gt; bitcnt:parse_header(B2). 
{[3,1],&lt;&lt;0,0,0,0,0,0,48,57&gt;&gt;}
</code></pre>

Even if header is empty (message starts with two consecutive zero bits) - function parse header into empty list:

<pre class="lang-eralng prettyprint-override"><code>7&gt; B3 = &lt;&lt;0:1, 0:1, 12345:64&gt;&gt;.
&lt;&lt;0,0,0,0,0,0,12,14,1:2&gt;&gt;
8&gt; 
8&gt; bitcnt:parse_header(B3). 
{[],&lt;&lt;0,0,0,0,0,0,48,57&gt;&gt;}
</code></pre>

P.S.

By the way, format of your header is very redundant. If you're want to encode big numbers, for example, number 1024 - you'll need to transform it to 1024 consecutive '1' bits!

There is two ways to improve format of your header:

<ul>
<li>if you know that any of your numbers is less than some threshold number: calculate how many bits you're need to encode number with maximum value, and encode each of your numbers in header with bitstring of pre-defined length. For example - if all of your numbers are less than 2^32 - you need 32 bit to encode each number from this interval</li>
<li>if you can't define threshold (number with maximum value): use variable length coding. For example, <a href="http://en.wikipedia.org/wiki/Elias_gamma_coding" rel="nofollow">Elias gamma-coding</a> or <a href="http://en.wikipedia.org/wiki/Exponential-Golomb_coding" rel="nofollow">Exponential-Golomb coding</a>. </li>
</ul>

blocks|key|4883789|text|到resque的Bitstring+comprehensions：|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|4883790|1>+Inp+=+<<1:1,0:1,3:2,0:1,7:3>>.
<<"À">>
2>+[+size(B)+%7C%7C+B+<-+binary:split(<<+<>+%7C%7C+<<I:1>>+<=+Inp+>>,+<<0>>,+[global])+].
[1,2,3]|code-block|syntax|javascript|4883791|entityMap|0|LINK|mutability|MUTABLE|url|http://www.erlang.org/doc/reference_manual/expressions.html#id79375^0|8|O|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@$A|R|B|S|1|T]]|C|$]]|$1|D|3|E|5|F|7|U|8|@]|9|@]|C|$G|H]]|$1|I|3|-4|5|6|7|V|8|@]|9|@]|C|$]]]|J|$K|$5|L|M|N|C|$O|P]]]]

<a href="http://www.erlang.org/doc/reference_manual/expressions.html#id79375" rel="nofollow">Bitstring comprehensions</a> to the resque:

<pre><code>1&gt; Inp = &lt;&lt;1:1,0:1,3:2,0:1,7:3&gt;&gt;.
&lt;&lt;"À"&gt;&gt;
2&gt; [ size(B) || B &lt;- binary:split(&lt;&lt; &lt;&lt;I&gt;&gt; || &lt;&lt;I:1&gt;&gt; &lt;= Inp &gt;&gt;, &lt;&lt;0&gt;&gt;, [global]) ].
[1,2,3]
</code></pre>

%Question 
Say I have a binary number: 
1011011101111011111 
Each digit is one bit.

I want to be able to transform that into: 
[1, 11, 111, 1111, 11111]

...and eventually into: 
[1, 2, 3, 4, 5]

%What I tried 
I tried binary:split, but data is always encoded in chunks of bits. I just want to work with the raw data (if that is possible.) 

%What I am trying to accomplish 
I am designing a header for a routing protocol. I want the header to contain a list of addresses that the packet has already visited. I figured I would not have to place any restrictions on the total length of the header if I give the header itself a header that consists of consecutive ones separated by zeros. The header's header would be separated from the header itself by two consecutive zeros. So if I had a payload that said: 
 &lt;&lt;"Hello World">> 
and the data has been visited by alice, bob, and carl, then header would be: 
&lt;&lt;"alicebobcarl">> 
and the header's header would be: 
(8*5 ones) 0 (8*3 ones) 0 (8*4 ones) 00 
assuming we are using some 8 bit encoding for the header.

Then the actual packet would read: 
(8*5 ones) 0 (8*3 ones) 0 (8*4 ones) 00 &lt;&lt;"alicebobcarl">> &lt;&lt;"Hello World">>

To decipher the header, I would first locate the first instance of 00, and split everything before that 00 at each 0. Then I would transform the resulting list into a list that contains number of bits in each address the packet had traveled to. Then I can finally read off the addresses from the header and retrieve the payload.

Erlang: Convert binary data into a list containing the number of consecutive ones

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

%个问题假设我有一个二进制数：1011011101111011111每个数字是一位。我希望能够将其转化为：1、11、111、1111、11111...and最终进入：1、2、3、4、5我尝试的百分比我尝试过binary:split，但是数据总是以位块的形式编码。我只想使用原始数据(如果可能的话)。我想要完成的%我正在为...

问Erlang:将二进制数据转换为包含连续数个1的列表
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Erlang:将二进制数据转换为包含连续数个1的列表EN