[LeetCode] 339. Nested List Weight Sum 嵌套鏈表權重和
Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element is either an integer, or a list ...
原文：[LeetCode] 364. Nested List Weight Sum II 嵌套鏈表權重和之二
Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element is either an integer, or a list whose elements may also be integers or other lists. D ...
2016-06-24 23:35 7 11601 推薦指數：
相關推薦
[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: 很奇怪為何沒有倒置鏈表之一，就來了這個倒置鏈表之二，不過猜 ...
[LeetCode] Flatten Nested List Iterator 壓平嵌套鏈表迭代器
Given a nested list of integers, implement an iterator to flatten it. Each element is either an integer, or a list -- whose elements may also ...
[LeetCode] 142. Linked List Cycle II 單鏈表中的環之二
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. To represent a cycle in the given linked list, we ...
[LeetCode] 454. 4Sum II 四數之和之二
Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are suc ...
[LeetCode] 40. Combination Sum II 組合之和之二
Given a collection of candidate numbers (candidates) and a target number (target), find all uniqu ...
[LeetCode] 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. Example ...
LeetCode 142. 環形鏈表 II（Linker List Cycle II）
題目描述 給定一個鏈表，返回鏈表開始入環的第一個節點。 如果鏈表無環，則返回 null。 說明：不允許修改給定的鏈表。 進階： 你是否可以不用額外空間解決此題？ 解題思路 分為三步： 首先判斷是否存在環，利用快慢指針法，從頭節點開始快指針每次走兩步 ...