Analog linked list quiz
2016-05-01 14:31
459 查看
/*
============================================================================
Name : Analog.c
Author : Cly
Version :
Copyright : Your copyright notice
Description : Hello World in C, Ansi-style
============================================================================
*/
#include <stdio.h>
#include <stdlib.h>
int main(void) {
freopen("./in.txt","r",stdin);
int data[101],right[101];
int i,n,t,len;
//读入已有的数
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&data[i]);
len=n;
//初始化数组right[]
for(i=1;i<=n;++i)
{
if(i!=n)
right[i]=i+1;
else
right[i]=0;
}
//直接在data[]末尾添加一个数
len++;
scanf("%d",&data[len]);
//从链表的头部开始遍历
t=1;
while(t!=0)
{
if(data[right[t]]>data[len]) //如果当前结点的下一个结点的值大于待插入数,将数插入中间
{
right[len]=right[t];
right[t]=len;
break; //完成插入跳出循环
}
t=right[t]; //依序遍历
}
//输出链中所有的数
t=1;
while(t!=0)
{
printf("%d ",data[t]);
t=right[t];
}
//关闭输入重定向
fclose(stdin);
return EXIT_SUCCESS;
}
============================================================================
Name : Analog.c
Author : Cly
Version :
Copyright : Your copyright notice
Description : Hello World in C, Ansi-style
============================================================================
*/
#include <stdio.h>
#include <stdlib.h>
int main(void) {
freopen("./in.txt","r",stdin);
int data[101],right[101];
int i,n,t,len;
//读入已有的数
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&data[i]);
len=n;
//初始化数组right[]
for(i=1;i<=n;++i)
{
if(i!=n)
right[i]=i+1;
else
right[i]=0;
}
//直接在data[]末尾添加一个数
len++;
scanf("%d",&data[len]);
//从链表的头部开始遍历
t=1;
while(t!=0)
{
if(data[right[t]]>data[len]) //如果当前结点的下一个结点的值大于待插入数,将数插入中间
{
right[len]=right[t];
right[t]=len;
break; //完成插入跳出循环
}
t=right[t]; //依序遍历
}
//输出链中所有的数
t=1;
while(t!=0)
{
printf("%d ",data[t]);
t=right[t];
}
//关闭输入重定向
fclose(stdin);
return EXIT_SUCCESS;
}
相关文章推荐
- Javascript实现关联数据(Linked Data)查询及注意细节
- 底版本编译时找不到高版本框架里的对象。那么就改成弱链接。就能通过编译了
- 如何查看Linux是32位还是64位
- linux查看系统版本(32位/64位)的方法
- ArrayList vs. LinkedList vs. Vector
- Technical Information Release For Bridger 1.0
- PB开发还有前途吗
- [leetCode] Intersection of Two Linked Lists
- 最长上升子序列(LIS)(HDU 1025)
- Leetcode#25||Reverse Nodes in k-Group
- Leetcode#24||Swap Nodes in Pairs
- Leetcode#21||Merge Two Sorted Lists
- Delete Node in a Linked List
- Reverse Nodes in k-Group
- Reverse Linked List II
- Swap Nodes in Pairs
- Remove Duplicates from Sorted List II
- Remove Duplicates from Sorted List
- Merge Two Sorted Lists
- Reverse Linked List