首页 > 试题广场 >

Deduplication on a Linked List

[编程题]Deduplication on a Linked List
  • 热度指数：5909 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 64M，其他语言128M
  • 算法知识视频讲解
Given a singly linked list L with integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each value K, only the first node of which the value or absolute value of its key equals K will be kept. At the mean time, all the removed nodes must be kept in a separate list. For example, given L being 21→-15→-15→-7→15, you must output 21→-15→-7, and the removed list -15→15.

输入描述:
Each input file contains one test case.  For each case, the first line contains the address of the first node, and a positive N (<= 105) which is the total number of nodes.  The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.
Then N lines follow, each describes a node in the format:
Address Key Next
where Address is the position of the node, Key is an integer of which absolute value is no more than 104, and Next is the position of the next node.


输出描述:
For each case, output the resulting linked list first, then the removed list.  Each node occupies a line, and is printed in the same format as in the input.
示例1

输入

00100 5
99999 -7 87654
23854 -15 00000
87654 15 -1
00000 -15 99999
00100 21 23854

输出

00100 21 23854
23854 -15 99999
99999 -7 -1
00000 -15 87654
87654 15 -1
算法知识视频讲解
开通博客
头像 懒散之魂
发表于 2021-09-19 15:21:13
个人博客的PAT题解 题目 OJ平台 题目详解 就是一个静态链表删除元素的数据结构类型题目，这题最坑的地方在于输出的时候需要地址五位数补0，如果是-1则不用补，导致你明明是对的，还以为是错误的。。🤷‍♂️ 我用队列存储删除的结点的地址，然后后面再进行连接即可。 解题代码 基本变量 int 展开全文
去ta的博客 赞 (0) 回复(0) 收起

问题信息

链表
难度：
27条回答 11379浏览

热门推荐

通过挑战的用户

相关试题

Deduplication on a Linked List (25)

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号