请高手指点迷津！急！在线恭候...

2007-04-28 02:30:48 366 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

用一行Python代码实现按字符串内数字大小排列字符串顺序大家好，我是Python之眼。今天给大家带来一篇干货！熟悉编程的朋友应该不难理解，为什么字符串排序"10"会排在"2"的前面。因为字符串大小比较是对各字符的编码值逐个进行比较，"1"<"2"，所以"10"<"2"。不过这不是本文想要达到的目标，本篇文章会用一行代码，让文本中出现的（任意多组）数字序号可以按照数字顺序进行排序。目录：〇、背景一、正则取出序号位置进行排序二、微软的排序策略三、Python实现排序四、一行代码排序〇、背景最近在爬虫某漫画网站阅读详情

It is really amazing that the great historian Dr.K has recently found that about 10 Million years ago, in the area where is now called China, lived an ancient people. They may be considered as the first intelligent creature existed on the earth.

As Dr.K's investigation advance, he found unbelievably that they even developed some so-called mathematics during their evolvement. Dr.K spent his half life to understand this ancient people's counting system. Finally he got to know that:
1、They use only 7 digits to represent numbers, and numbers are as follow:
| -> 1
|| -> 2
||| -> 3
|||| -> 4
||||| -> 5
|||||| -> 6
||||||| -> 7
It is a pity that they have not developed "0" before these people disappeared.
2、If a number is greater than 7, they use digit place just as we do today. Between each two digit places, there is a ",".
eg:
|||||,|| -> 42 (5x8+2)
|||,||,|||| -> 212 (3*64+2*8+4)

In order to further his study, Dr.K wants to know what the sequences found from stones mean in today's counting system. He turns to you for help, and smart as you are, you should help this great historian,should not you?

Input

The first line of standard input contains an integer N, the number of test cases. N lines followed.
In each line a sequence is given, it is guaranteed that the length of the sequence will not exceed 1024 characters and the outcome number will not be greater than 1000000.

Output

For each case you are to output a line giving the number in today's decimal counting system.

Sample Input

3
|||||,||
|||,||,||||
||,|,|,|,||||

Sample Output

42
212
8780

...全文

Lumerical Python API实战指南（一）——从数据优化到自动化工作流本文是Lumerical Python API实战指南，旨在帮助用户从繁琐的手动仿真操作转向智能自动化工作流。文章详细介绍了API环境的零基础搭建、核心操作（会话管理、命令执行与数据交换），并通过参数扫描与自动化分析流水线的实战案例，展示了如何利用Python脚本实现从数据优化到自动化仿真的全过程，显著提升光子设计效率。阅读详情

燕尾鱼

C++ 语言 65,214 成员 250,514 内容

+ 关注 + 加入社区

切换为时间正序

D_BOY_JQ 2007-04-28

打赏
举报

我不是高手:)
#include <iostream>
#include <string>
#include <queue>
#include <math.h>

using namespace std;

int main(int, char*[])
{
int nLineCount;
char input[1024];
cout<<"input:\n";
cin>>nLineCount;
queue<string> v;

for (int i = 0; i < nLineCount; ++i)
{
cin>>input;
int start = 0;
int result = 0;
int j;

for (j = 0; input[j] != 0; ++j)
{
if (input[j] == ',')
{
v.push(string(input + start, input + j));
start = j + 1;
}
}

if (j > start)
{
v.push(string(input + start, input + j));
}

while(v.size() > 0)
{
result += (v.front().size() * pow(8.f, (int)v.size() - 1));
v.pop();
}
cout<<result<<endl;
}

return 0;
}

燕尾鱼 2007-04-28

打赏
举报

要求是一次性出结果

输入格式：
3
|||||,||
|||,||,||||
||,|,|,|,||||

输出格式：
42
212
8780
哥（星辰）麻烦你再帮我想想吧
谢谢了我挺着急的

dai_weitao 2007-04-28

打赏
举报

这个很简单啊.
把输入存入char *buf[BUFFSIZE]中, 用for循环从头至尾分离buf的内容.
剩下的就是计算问题了.

jixingzhong 2007-04-28

打赏
举报

如果需要做输入正确性校验，
使用 string 的 find_first_not_of 方法即可。

jixingzhong 2007-04-28

打赏
举报

#include <cmath>
#include <string>
#include <iostream>
#include <cstdlib>

int main()
{
int i, n;
cout<<"请输入行数: ";
cin>>n;

string line, tmp;
int num, index, power;
for(i=1; i<n+1; i++)
{
num=0, power=0, index=0;
cout<<"请输入第 "<<i<<" 行: ";
cin>>line;

index = line.find(',', 0);
while(index != string::npos)
{
power++;
index = line.find(',', index+1);
}

tmp = line;
while(power>0)
{
index = tmp.find(',', 0);
num += (index)*pow(8.0, power);
tmp = tmp.substr(index+1);
power --;
}
num += tmp.length();
cout<<line<<" ~ "<<num<<endl;
}
system("pause");
return 0;
}

jixingzhong 2007-04-28

打赏
举报

不做输入的正确性校验，
（即假设用户输入都是符合输入数据标准的）
参考代码如下：

lidongri 2007-04-28

打赏
举报

用中文把

请高手指点迷津！急！在线恭候...

相关推荐