链表
山农数学姜赫
这个作者很懒,什么都没留下…
展开
-
删除链表中的元素 - C++
class Solution {public: /** * @param head a ListNode * @param val an integer * @return a ListNode */ ListNode *removeElements(ListNode *head, int val) { ListNode *fir原创 2017-03-29 22:37:50 · 1907 阅读 · 0 评论 -
链表求和 - C++
class Solution {public: /** * @param l1: the first list * @param l2: the second list * @return: the sum list of l1 and l2 */ ListNode *addLists(ListNode *l1, ListNode *l2原创 2017-03-29 22:48:41 · 642 阅读 · 0 评论 -
链表倒数第n个节点 - C++
class Solution {public: /** * @param head: The first node of linked list. * @param n: An integer. * @return: Nth to last node of a singly linked list. */ ListNode *nthToL原创 2017-03-29 22:48:09 · 304 阅读 · 0 评论 -
合并两个排序链表 - C++
class Solution {public: /** * @param ListNode l1 is the head of the linked list * @param ListNode l2 is the head of the linked list * @return: ListNode head of linked list */原创 2017-03-29 22:47:37 · 193 阅读 · 0 评论 -
链表划分 - C++
class Solution {public: /** * @param head: The first node of linked list. * @param x: an integer * @return: a ListNode */ ListNode *partition(ListNode *head, int x) {原创 2017-03-29 22:45:06 · 239 阅读 · 0 评论 -
链表插入排序 - C++
class Solution {public: /** * @param head: The first node of linked list. * @return: The head of linked list. */ ListNode *insertionSortList(ListNode *head) { int a[100原创 2017-03-29 22:44:39 · 333 阅读 · 0 评论 -
删除链表中的元素 - C++
class Solution {public: /** * @param head a ListNode * @param val an integer * @return a ListNode */ ListNode *removeElements(ListNode *head, int val) { ListNode *dum原创 2017-03-29 22:44:06 · 358 阅读 · 0 评论 -
删除链表中倒数第n个节点 - C++
class Solution {public: /** * @param head: The first node of linked list. * @param n: An integer. * @return: The head of linked list. */ ListNode *removeNthFromEnd(ListNod原创 2017-03-29 22:43:18 · 357 阅读 · 0 评论 -
两两交换链表中的节点 - C++
class Solution {public: /** * @param head a ListNode * @return a ListNode */ ListNode* swapPairs(ListNode* head) { ListNode *x; x=head;原创 2017-03-29 22:42:36 · 319 阅读 · 0 评论 -
删除排序链表中的重复元素 - C++
class Solution {public: /** * @param head: The first node of linked list. * @return: head node */ ListNode *deleteDuplicates(ListNode *head) { ListNode *templete,*temp原创 2017-03-29 22:41:12 · 503 阅读 · 0 评论 -
在O(1)时间复杂度删除链表节点 - C++
class Solution {public: /** * @param node: a node in the list should be deleted * @return: nothing */ void deleteNode(ListNode *node) { ListNode *templete; temp原创 2017-03-29 22:40:36 · 278 阅读 · 0 评论 -
翻转链表 - C++
class Solution {public: /** * @param head: The first node of linked list. * @return: The new head of reversed linked list. */ ListNode *reverse(ListNode *head) { ListNo原创 2017-03-29 22:39:51 · 197 阅读 · 0 评论 -
二叉树的所有路径 - C++
#includeclass Solution {public: /** * @param root the root of the binary tree * @return all root-to-leaf paths */ vector a; vector a1[200]; vector ::iterator b1;原创 2017-04-20 17:21:07 · 628 阅读 · 0 评论