[LeetCode] Plus One 加一运算
Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit ...
原文：[LeetCode] 369. Plus One Linked List 链表加一运算
Given a non negative integer represented asnon emptya singly linked list of digits, plus one to the integer. You may assume the integer do not contain any leading zero, except the number itself. The ...
2016-06-29 12:01 2 9844 推荐指数：
相关推荐
【LeetCode题解】链表Linked List
1. 链表 数组是一种顺序表，index与value之间是一种顺序映射，以\(O(1)\)的复杂度访问数据元素。但是，若要在表的中间部分插入（或删除）某一个元素时，需要将后续的数据元素进行移动，复杂度大概为\(O(n)\)。链表（Linked List）是一种链式表，克服了上述的缺点，插入和删除 ...
[LeetCode] 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 ...
[LeetCode] Reverse Linked List 倒置链表
Reverse a singly linked list. Example: Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both ...
[LeetCode] Linked List Components 链表组件
We are given head, the head node of a linked list containing unique integer values. We are also given the list G, a subset of the values ...
[LeetCode]77. Reverse Linked List反转链表
Reverse a singly linked list. click to show more hints. Hint: A linked list can be reversed either iteratively or recursively. Could you ...
[LeetCode] 876. Middle of the Linked List 链表的中间结点
Given a non-empty, singly linked list with head node `head`, return a middle node of linked list. If there are two middle nodes, return the second ...
[LeetCode] 92. Reverse Linked List II 倒置链表之二
Reverse a linked list from position m to n. Do it in one-pass. Note: 1 ≤ m ≤ n ≤ length of list. Example: 很奇怪为何没有倒置链表之一，就来了这个倒置链表之二，不过猜 ...