https://blog.youkuaiyun.com/Nemo_tingzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Nemo_ting/article/details/159655814https://blog.youkuaiyun.com/Nemo_ting/article/details/159655814Nemo_tingMon, 30 Mar 2026 21:41:13 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/157470466https://blog.youkuaiyun.com/Nemo_ting/article/details/157470466Nemo_tingWed, 28 Jan 2026 14:45:05 +0800>= 7 • 判断是否为最后一组：看n是否为0。1. 核心思想：将正整数表示为二进制，从低位到高位每7位一组，每组加上最高位（最后一组加0，其余加1）。3. 边界情况处理： • n=0时，直接输出00 • 注意字节顺序：先处理低位字节，先输出低位字节。• 设置最高位：非最后一组时，byte |= 0x80。这是我的代码和解析，大家如果有意见，尽管发表。由于复制不便，请自行到洛谷查看题目。]]>https://blog.youkuaiyun.com/Nemo_ting/article/details/157438759https://blog.youkuaiyun.com/Nemo_ting/article/details/157438759Nemo_tingTue, 27 Jan 2026 20:34:37 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/157401167https://blog.youkuaiyun.com/Nemo_ting/article/details/157401167Nemo_tingMon, 26 Jan 2026 20:46:59 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/152457595https://blog.youkuaiyun.com/Nemo_ting/article/details/152457595Nemo_tingFri, 03 Oct 2025 16:54:32 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/150925202https://blog.youkuaiyun.com/Nemo_ting/article/details/150925202Nemo_tingWed, 27 Aug 2025 14:20:42 +0800[-<] 编码后变成了 0110111101010000101。可以确定的是，符合编码规则的 01 序列只能对应一种唯一的符号序列。给定一串符合编码规则 01 序列，请还原它对应的符号序列。b 表示输入数据的长度，则。若干 01 表示输入。[ 的编码为 010。] 的编码为 101。+ 的编码为 011。若干个符号表示输出。]]>https://blog.youkuaiyun.com/Nemo_ting/article/details/150462935https://blog.youkuaiyun.com/Nemo_ting/article/details/150462935Nemo_tingSun, 17 Aug 2025 10:24:49 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/149831354https://blog.youkuaiyun.com/Nemo_ting/article/details/149831354Nemo_tingFri, 01 Aug 2025 12:42:00 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/149741976https://blog.youkuaiyun.com/Nemo_ting/article/details/149741976Nemo_tingTue, 29 Jul 2025 11:00:15 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/149542395https://blog.youkuaiyun.com/Nemo_ting/article/details/149542395Nemo_tingTue, 22 Jul 2025 17:31:21 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/149470400https://blog.youkuaiyun.com/Nemo_ting/article/details/149470400Nemo_tingSat, 19 Jul 2025 21:19:16 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/149175061https://blog.youkuaiyun.com/Nemo_ting/article/details/149175061Nemo_tingMon, 07 Jul 2025 16:05:30 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/149167735https://blog.youkuaiyun.com/Nemo_ting/article/details/149167735Nemo_tingMon, 07 Jul 2025 10:39:24 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/149167534https://blog.youkuaiyun.com/Nemo_ting/article/details/149167534Nemo_tingMon, 07 Jul 2025 10:31:53 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/149141567https://blog.youkuaiyun.com/Nemo_ting/article/details/149141567Nemo_tingSat, 05 Jul 2025 20:30:16 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/149141469https://blog.youkuaiyun.com/Nemo_ting/article/details/149141469Nemo_tingSat, 05 Jul 2025 20:14:33 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/149074716https://blog.youkuaiyun.com/Nemo_ting/article/details/149074716Nemo_tingWed, 02 Jul 2025 17:34:51 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/148748063https://blog.youkuaiyun.com/Nemo_ting/article/details/148748063Nemo_tingWed, 18 Jun 2025 20:26:07 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/148747858https://blog.youkuaiyun.com/Nemo_ting/article/details/148747858Nemo_tingWed, 18 Jun 2025 20:13:19 +0800https://blog.youkuaiyun.com/Nemo_ting/article/details/148747069https://blog.youkuaiyun.com/Nemo_ting/article/details/148747069Nemo_tingWed, 18 Jun 2025 19:25:00 +0800