乐乐章

2017年10月26日

摘要： Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical a 阅读全文

posted @ 2017-10-26 10:15 乐乐章阅读(135) 评论(0) 推荐(0) 编辑

538. 把二叉搜索树转换为累加树

摘要： labuladong 题解思路难度中等 899 给出二叉搜索树的根节点，该树的节点值各不相同，请你将其转换为累加树（Greater Sum Tree），使每个节点 node 的新值等于原树中大于或等于 node.val 的值之和。提醒一下，二叉搜索树满足下列约束条件：节点的左子树仅包含键阅读全文

posted @ 2017-10-26 10:04 乐乐章阅读(137) 评论(0) 推荐(0) 编辑

445. Add Two Numbers II

摘要： You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contai 阅读全文

posted @ 2017-10-26 08:59 乐乐章阅读(117) 评论(0) 推荐(0) 编辑

2017年10月25日

82. Remove Duplicates from Sorted List II（删除有序链表中的重复元素）

摘要： Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example,Given 1->2 阅读全文

posted @ 2017-10-25 10:06 乐乐章阅读(197) 评论(0) 推荐(0) 编辑

86. Partition List

摘要： 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 阅读全文

posted @ 2017-10-25 09:36 乐乐章阅读(142) 评论(0) 推荐(0) 编辑

2017年10月24日

328. Odd Even Linked List

摘要： Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the 阅读全文

posted @ 2017-10-24 22:29 乐乐章阅读(101) 评论(0) 推荐(0) 编辑

2017年10月23日

19. Remove Nth Node From End of List(移除倒数第N的结点，快慢指针)

摘要： 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 rem 阅读全文

posted @ 2017-10-23 20:19 乐乐章阅读(141) 评论(0) 推荐(0) 编辑

2017年10月22日

24. Swap Nodes in Pairs

摘要： Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3. Your a 阅读全文

posted @ 2017-10-22 20:48 乐乐章阅读(109) 评论(0) 推荐(0) 编辑

2017年10月21日

2. Add Two Numbers(2个链表相加)

摘要： You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contai 阅读全文

posted @ 2017-10-21 22:31 乐乐章阅读(185) 评论(0) 推荐(0) 编辑

2017年10月20日

92. Reverse Linked List II（链表部分反转）

摘要： Reverse a linked list from position m to n. Do it in-place and in one-pass. For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2- 阅读全文

posted @ 2017-10-20 22:11 乐乐章阅读(197) 评论(0) 推荐(0) 编辑

NLP/推荐我很菜

公告

乐乐章

NLP/推荐 我很菜

公告

NLP/推荐我很菜