1052. Linked List Sorting
来源:互联网 发布:java cmd 复制文件夹 编辑:程序博客网 时间:2024/05/19 17:10
A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now given a linked list, you are supposed to sort the structures according to their key values in increasing order.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive N (< 105) and an address of the head node, where N is the total number of nodes in memory and the address of a node is a 5-digit positive integer. NULL is represented by -1.
Then N lines follow, each describes a node in the format:
Address Key Next
where Address is the address of the node in memory, Key is an integer in [-105, 105], and Next is the address of the next node. It is guaranteed that all the keys are distinct and there is no cycle in the linked list starting from the head node.
Output Specification:
For each test case, the output format is the same as that of the input, where N is the total number of nodes in the list and all the nodes must be sorted order.
只有18分,oh,不管了
#include <stdio.h>#include <stdlib.h>#include <vector>#include <algorithm>using namespace std;typedef struct{ int add,key,next; }Node;vector<Node> node;bool cmp ( Node a,Node b);int main (){ int i,n,start; Node temp; scanf("%d %d",&n,&start); for( i=0;i<n;i++) { scanf("%d %d %d",&temp.add,&temp.key,&temp.next); node.push_back(temp); } sort(node.begin(),node.end(),cmp); printf("%d %d\n",node.size(),node[0].add); for( i=0;i<n-1;i++) { printf("%.5d %d %.5d\n",node[i].add,node[i].key,node[i+1].add); } printf("%d %d %d\n",node[i].add,node[i].key,-1); system("pause"); return 0; }bool cmp ( Node a,Node b){ return a.key<b.key; }
- 1052. Linked List Sorting
- 1052. Linked List Sorting
- 1052. Linked List Sorting
- 1052.Linked List Sorting
- 1052. Linked List Sorting
- 1052. Linked List Sorting
- 1052. Linked List Sorting
- 1052. Linked List Sorting
- 1052. Linked List Sorting
- 1052. Linked List Sorting (25)
- 1052. Linked List Sorting (25)
- 1052. Linked List Sorting (25)
- 1052. Linked List Sorting (25)
- PAT 1052. Linked List Sorting
- 1052. Linked List Sorting (25)
- 1052. Linked List Sorting (25)
- 1052. Linked List Sorting (25)
- 1052. Linked List Sorting (25)
- 表查询与聚合函数
- break,continue和return的区别
- HTML常用标签之超链接标签
- Spring AOP 代理机制
- linux DM设备
- 1052. Linked List Sorting
- 9、MySQL-主键约束(PRIMARY KEY)
- 期望,方差,协方差,标准差,协方差矩阵
- 使用logback时候如何兼容其他日志框架
- Android高效加载大图、多图解决方案,有效避免程序OOM
- NGUI 代码布局工具
- 10、MySQL-自增长约束(AUTO_INCREMENT)
- iOS开发之版本兼容一,使用#ifdef语法
- 机器学习--朴素贝叶斯分类