#include <iostream>
#include <string>
using namespace std;
#define maxsize 100
#define null 0
typedef struct node
{
int data;
struct node * next;
}node, *linklist;
int strtonum(string s)
{
int i=0,len=s.length();
int num=0;
int n=1;
for(i=len-1;i>=0;i--)
{
num=num+(s[i]-'0')*(n);
n=n*10;
}
return num;
}
int main()
{
string s;
getline(cin,s);
int a[maxsize]={0};
int pos[maxsize]={0};
int k=0;
int i=0,len=s.length();
for(i=0;i<len;i++)
{
if(s[i]==',')
{
pos[k]=i;
k++;
}
}
a[0]=strtonum(s.substr(0,pos[0]));
for(i=0;i<k-1;i++)
{
a[i+1]=strtonum(s.substr(pos[i]+1,pos[i+1]-pos[i]-1));
}
a[i+1]=strtonum(s.substr(pos[i]+1,len-1-pos[i]));
int lena=k+1;
linklist phead;
linklist p;
linklist r=(linklist)m
【链表】逆序输出
最新推荐文章于 2022-09-08 21:35:42 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)