We are given a linked list with head as the first node. Let's number th...
投稿
收錄了18篇文章 · 2人關(guān)注
-
[LeetCode] Next Greater Node In Linked List
-
[LeetCode] Binary Prefix Divisible By 5
Given an array A of 0s and 1s, consider N_i: the i-th subarray from A[0]...
-
[LeetCode] Smallest Integer Divisible by K
Given a positive integer K, you need find the smallest positive integer ...
-
[LeetCode] Best Sightseeing Pair
Given an array A of positive integers, A[i] represents the value of the ...
-
[LeetCode] Convert to Base -2
Given a number N, return a string consisting of "0"s and "1"s that repre...
-
[LeetCode] Partition Array Into Three Parts With Equal Sum
Given an array A of integers, return true if and only if we can partitio...
-
[LeetCode] Capacity To Ship Packages Within D Days
A conveyor belt has packages that must be shipped from one port to anoth...
-
[LeetCode] Complement of Base 10 Integer
Every non-negative integer N has a binary representation. For example, ...
-
[LeetCode] Pairs of Songs With Total Durations Divisible by 60
In a list of songs, the i-th song has a duration of time[i] seconds. Ret...
-
[LeetCode] Construct Binary Search Tree from Preorder TraversalReturn the root node of a binary search tree that matches the given preo...
{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1881139527',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://upload.jianshu.io/collections/images/1690965/20151218132759977.jpg', '推薦專題《程序員代碼面試》（ 分享自 @簡書 ）','http://m.itdecent.cn/c/0c1a2d5b6b99?utm_campaign=maleskine&utm_content=collection&utm_medium=reader_share&utm_source=weibo','頁面編碼gb2312|utf-8默認(rèn)gb2312'));){kind=link}