1052. Linked List Sorting (25)

最新推荐文章于 2022-09-02 23:55:16 发布
原创 最新推荐文章于 2022-09-02 23:55:16 发布 · 292 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文介绍了一种通过使用map来优化查找算法的方法。原本采用自定义find函数进行遍历查找的方式超时，改用map后虽然大部分测试点通过，但仍有一处未能解决。文中提供了完整的C++代码实现。

摘要生成于 C知道 ，由 DeepSeek-R1 满血版支持， 前往体验 >

点击打开链接

开始find函数是自己写的，for循环查找，超时

果断换用map，过了，但是仍有一点未过，结果为零也考虑了，还有什么呢？！！！

答：

printf("0 -1\n");


#include <vector>
#include<cstdio>
#include <algorithm>
#include <map>
using namespace std;
struct no{
	int val;
	int add;
	int next;
}tmp[100010];
vector <no> node;
int n;
map <int,int>tmpmap;
//map <int,int>nodemap;
bool cmp(no a,no b){
	return a.val<b.val;
}
int main(){
	freopen("in.txt","r",stdin);
	int s;
	scanf("%d %d",&n,&s);
	for(int i=0;i<n;i++){
		scanf("%d %d %d",&tmp[i].add,&tmp[i].val,&tmp[i].next);
		tmpmap[ tmp[i].add ]=i;
	}
	int cnt=0;
	map<int,int>::iterator it=tmpmap.find(s);
	if(it!=tmpmap.end()){
		int k=it->second;
		no tt;
		tt.add=s;
		tt.val=tmp[k].val;
		tt.next=tmp[k].next;
		node.push_back(tt);
		while(node[cnt].next!=-1){
			cnt++;
			tt.add=node[cnt-1].next;
			map<int,int>::iterator ff=tmpmap.find(tt.add);
			k=ff->second;
			tt.val=tmp[k].val;
			tt.next=tmp[k].next;
			node.push_back(tt);
		}
		sort(node.begin(),node.end(),cmp);
		s=node[0].add;
		for(int i=0;i<cnt;i++){
			node[i].next=node[i+1].add;
		}
		node[cnt++].next=-1;
		printf("%d %05d\n",cnt,s);
		for(int i=0;i<cnt;i++){
			if(node[i].next!=-1){
				printf("%05d %d %05d\n",node[i].add,node[i].val,node[i].next);
			}else{
				printf("%05d %d -1\n",node[i].add,node[i].val);
			}

		}

	}else{
		printf("0\n");
	}
	
	return 0;
}


Algorithm Review (Python) - Sorting/ List ADT/ PQ ADT/ Table ADT
Buluchacha的博客
12-03 1075
Algorithm Review (Python) - Sorting/ List ADT/ PQ ADT/ Table ADT (Reference: Steven Halim, NUS senior lecturer and founder of VisuAlgo). Only for private review, and NO sharing.
List.Sort()底层代码解析及实现
u012291690的博客
07-05 735
首先来看List接口中的官方文档 /** * Sorts this list according to the order induced by the specified * {@link Comparator}. * * <p>All elements in this list must be <i>mutually comparable</i> using the * specified comparator (th
PAT-1052 Linked List Sorting
Eric的博客
08-24 237
1052 Linked List Sorting（25 分） 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...
1052. Linked List Sorting
LchinaM的专栏
03-06 604
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 give
1052 Linked List Sorting
行步至春深
08-07 160
1. 开始测试点4不通过，得分24/25，是忽略了所有节点都不在链表上的特殊情况。 2. 其实就是用静态链表，把结点根据值的大小，升序排列，所以一开始把每个结点的key赋值为超出最大值的maxn，是为了方便输出。 3. 并非给的所有结点都在链表上，用值inLink，并赋初始值为0，如果在链表上赋值为1，再在排序函数比较key之前比较inLink,这样确保输出的都是链表上的结点。 4. 在排序之后，把所有点的next赋值为下一个点的add，最后一个点的next赋值为-1。 AC代码 #includ
【PAT】A-1052 Linked List Sorting【链表】
elegant coder
07-25 604
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 give...
PAT A1052Linked List Sorting(测试点3：输出首节点地址时也要保证格式)
qq_40737596的博客
07-05 434
#include <iostream> #include <iomanip> #include <algorithm> using namespace std; #define MAX 100010 struct node { int add; int key; int next; int flag; }; bool cmp(node a, node b) { return a.key < b.key; } int main() { int n, fir
1074 Reversing Linked List
weixin_44230791的博客
02-22 175
1074 Reversing Linked List Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K=3, then you must output 3→2→1→6→5→4; if K=4, you must output 4→3→2→1→5→6.
「1052」Linked List Sorting
weixin_52435933的博客
09-02 132
A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integerkeyand aNextpointer to the next structure....
1052 Linked List Sorting（链表排序）
qq_41698081的博客
06-21 254
1052 Linked List Sorting (25 分) 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 pointe...
请参考我给出的代码框架，实现对EMPLOYEE结构体为数据的双向链表的排序算法，要求按照按employeeId升序排列 typedef struct linkNode { void* data; //使用空指针使得NODE适配多种数据结构 struct linkNode* preNode; struct linkNode* nextNode; }LINKED_NODE; /*Define the struct of double linked list.*/ typedef struct { LINKED_NODE* head; LINKED_NODE* tail; size_t size; }DOUBLE_LINK_LIST; typedef struct { int employeeId; char name[20]; char ipAddress[30]; char seatNumber[20]; char group[10]; } EMPLOYEE; DOUBLE_LINK_LIST* createDoubleLinkedList() { DOUBLE_LINK_LIST* newList = (DOUBLE_LINK_LIST*)malloc(sizeof(DOUBLE_LINK_LIST)); newList->head = NULL; newList->tail = NULL; newList->size = 0; return newList; } void destroyDoubleLinkedList(DOUBLE_LINK_LIST* list) {} /*Add a new node before the head.*/ void insertHead(DOUBLE_LINK_LIST* list, void* data) // void执政适配其他data类型？ {} /*Add a new node after tail.*/ void insertTail(DOUBLE_LINK_LIST* list, void* data) // 如何适配其他data类型？ {} /*Insert a new node.*/ void insertNode(DOUBLE_LINK_LIST* list, void* data,int index) // 如何适配其他data类型？ {} void deleteHead(DOUBLE_LINK_LIST* list) {} void deleteTail(DOUBLE_LINK_LIST* list) {} void deleteNode(DOUBLE_LINK_LIST* list, int index) {} LINKED_NODE* getNode(DOUBLE_LINK_LIST* list, int index) {} /* 遍历链表，对每个节点执行指定操作*/ void traverseList(DOUBLE_LINK_LIST* list, void (*callback)(void*)) { LINKED_NODE* currentNode = list->head; while (currentNode != NULL) { callback(currentNode->data); currentNode = currentNode->nextNode; } } void printEmployee(void* data) {}
07-25
你可以使用以下代码来实现对EMPLOYEE结构体为数据的双向链表的排序算法，按照按employeeId升序排列： ```c #include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct linkNode { void* data; //使用空指针使得NODE适配多种数据结构 struct linkNode* preNode; struct linkNode* nextNode; } LINKED_NODE; /*Define the struct of double linked list.*/ typedef struct { LINKED_NODE* head; LINKED_NODE* tail; size_t size; } DOUBLE_LINK_LIST; typedef struct { int employeeId; char name[20]; char ipAddress[30]; char seatNumber[20]; char group[10]; } EMPLOYEE; DOUBLE_LINK_LIST* createDoubleLinkedList() { DOUBLE_LINK_LIST* newList = (DOUBLE_LINK_LIST*)malloc(sizeof(DOUBLE_LINK_LIST)); newList->head = NULL; newList->tail = NULL; newList->size = 0; return newList; } void destroyDoubleLinkedList(DOUBLE_LINK_LIST* list) { LINKED_NODE* currentNode = list->head; while (currentNode != NULL) { LINKED_NODE* nextNode = currentNode->nextNode; free(currentNode); currentNode = nextNode; } free(list); } /*Add a new node before the head.*/ void insertHead(DOUBLE_LINK_LIST* list, void* data) { LINKED_NODE* newNode = (LINKED_NODE*)malloc(sizeof(LINKED_NODE)); newNode->data = data; newNode->preNode = NULL; newNode->nextNode = list->head; if (list->head != NULL) list->head->preNode = newNode; list->head = newNode; if (list->tail == NULL) list->tail = newNode; list->size++; } /*Add a new node after tail.*/ void insertTail(DOUBLE_LINK_LIST* list, void* data) { LINKED_NODE* newNode = (LINKED_NODE*)malloc(sizeof(LINKED_NODE)); newNode->data = data; newNode->preNode = list->tail; newNode->nextNode = NULL; if (list->tail != NULL) list->tail->nextNode = newNode; list->tail = newNode; if (list->head == NULL) list->head = newNode; list->size++; } /*Insert a new node.*/ void insertNode(DOUBLE_LINK_LIST* list, void* data, int index) { if (index < 0 || index > list->size) { printf("Invalid index\n"); return; } if (index == 0) { insertHead(list, data); return; } if (index == list->size) { insertTail(list, data); return; } LINKED_NODE* currentNode = getNode(list, index); LINKED_NODE* newNode = (LINKED_NODE*)malloc(sizeof(LINKED_NODE)); newNode->data = data; newNode->preNode = currentNode->preNode; newNode->nextNode = currentNode; currentNode->preNode->nextNode = newNode; currentNode->preNode = newNode; list->size++; } void deleteHead(DOUBLE_LINK_LIST* list) { if (list->head == NULL) return; LINKED_NODE* oldHead = list->head; list->head = oldHead->nextNode; if (list->head != NULL) list->head->preNode = NULL; free(oldHead); list->size--; if (list->size == 0) list->tail = NULL; } void deleteTail(DOUBLE_LINK_LIST* list) { if (list->tail == NULL) return; LINKED_NODE* oldTail = list->tail; list->tail = oldTail->preNode; if (list->tail != NULL) list->tail->nextNode = NULL; free(oldTail); list->size--; if (list->size == 0) list->head = NULL; } void deleteNode(DOUBLE_LINK_LIST* list, int index) { if (index < 0 || index >= list->size) { printf("Invalid index\n"); return; } if (index == 0) { deleteHead(list); return; } if (index == list->size - 1) { deleteTail(list); return; } LINKED_NODE* currentNode = getNode(list, index); currentNode->preNode->nextNode = currentNode->nextNode; currentNode->nextNode->preNode = currentNode->preNode; free(currentNode); list->size--; } LINKED_NODE* getNode(DOUBLE_LINK_LIST* list, int index) { if (index < 0 || index >= list->size) { printf("Invalid index\n"); return NULL; } LINKED_NODE* currentNode = list->head; int i = 0; while (i < index) { currentNode = currentNode->nextNode; i++; } return currentNode; } void traverseList(DOUBLE_LINK_LIST* list, void (*callback)(void*)) { LINKED_NODE* currentNode = list->head; while (currentNode != NULL) { callback(currentNode->data); currentNode = currentNode->nextNode; } } void printEmployee(void* data) { EMPLOYEE* employee = (EMPLOYEE*)data; printf("Employee ID: %d, Name: %s\n", employee->employeeId, employee->name); } int compareEmployee(const void* a, const void* b) { EMPLOYEE* employeeA = (EMPLOYEE*)a; EMPLOYEE* employeeB = (EMPLOYEE*)b; return employeeA->employeeId - employeeB->employeeId; } void sortList(DOUBLE_LINK_LIST* list) { size_t dataSize = sizeof(EMPLOYEE); EMPLOYEE** employeeArray = (EMPLOYEE**)malloc(list->size * sizeof(EMPLOYEE*)); LINKED_NODE* currentNode = list->head; size_t i = 0; while (currentNode != NULL) { employeeArray[i] = (EMPLOYEE*)currentNode->data; currentNode = currentNode->nextNode; i++; } qsort(employeeArray, list->size, dataSize, compareEmployee); currentNode = list->head; i = 0; while (currentNode != NULL) { currentNode->data = employeeArray[i]; currentNode = currentNode->nextNode; i++; } free(employeeArray); } int main() { DOUBLE_LINK_LIST* list = createDoubleLinkedList(); EMPLOYEE* employee1 = (EMPLOYEE*)malloc(sizeof(EMPLOYEE)); employee1->employeeId = 2; strcpy(employee1->name, "John"); insertHead(list, employee1); EMPLOYEE* employee2 = (EMPLOYEE*)malloc(sizeof(EMPLOYEE)); employee2->employeeId = 1; strcpy(employee2->name, "Alice"); insertHead(list, employee2); EMPLOYEE* employee3 = (EMPLOYEE*)malloc(sizeof(EMPLOYEE)); employee3->employeeId = 3; strcpy(employee3->name, "Bob"); insertHead(list, employee3); printf("Before sorting:\n"); traverseList(list, printEmployee); sortList(list); printf("\nAfter sorting:\n"); traverseList(list, printEmployee); destroyDoubleLinkedList(list); return 0; } ``` 这段代码首先定义了双向链表的结构体和EMPLOYEE结构体，然后实现了双向链表的创建、销毁、插入、删除、遍历等操作。其中，`sortList`函数使用了快速排序算法对双向链表中的EMPLOYEE结构体按照employeeId升序进行排序。在`main`函数中，创建了一个双向链表并插入了三个EMPLOYEE结构体，然后调用`sortList`函数对链表进行排序并输出结果。 请注意，在代码中使用了动态内存分配（`malloc`）来分配内存，并在适当的时候使用了`free`来释放内存，以防止内存泄漏。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值