登录
|
注册
公司
标签
文章
搜索
链表
热门公司
阿里巴巴
微软
腾讯
迅雷
华为
百度
热门职位
研发工程师
C语言工程师
所有
有回答
没回答
新题目
有最佳答案
排序
热度
·
时间
·
经典指数
0
0
1060
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of the two partitions. For example, Given1->4->3->2->5->2and x = 3, return1->2->2->4->3->5. ...
阅读题目
链表
面试题
经典指数
0
0
1012
Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5. Note: Given n will always be valid. Try to do this in one pass. ...
阅读题目
链表
面试题
经典指数
0
0
1011
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 li ...
阅读题目
链表
面试题
经典指数
1
0
997
下列链表中,其逻辑结构属于非线性结构的是 二叉链表 循环链表 双向链表 带链的栈 ...
阅读题目
链表
单选题
经典指数
1
0
996
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. ...
阅读题目
链表
面试题
经典指数
0
0
991
linkedlist arraylist内部是如何实现的。 ...
阅读题目
链表
问答题
经典指数
1
0
989
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. ...
阅读题目
链表
面试题
经典指数
1
0
970
输入一个链表,输出该链表中倒数第k个结点。 ...
阅读题目
链表
面试题
经典指数
0
0
965
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list. Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 ...
阅读题目
链表
面试题
经典指数
1
0
947
Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given1->2->3->4->5->NULLand k =2, return4->5->1->2->3->NULL. ...
阅读题目
链表
面试题
经典指数
<<
<
21
22
23
24
25
>
>>
249
题目数
1
贡献者
212
答案数
扫描后移动端查看
我也分享一个题目
相关标签
数组
阿里巴巴
研发工程师
队列
C语言工程师
栈
复杂度
树
哈希
2015
同类标签
树
排序
数组
字符串
复杂度
查找
栈
图
哈希
队列
微信公众号
欢迎加入,一起群聊
×
登录
注册
找回密码
记住登录
登录
快速注册
直接第三方登录