MrRoyLee的专栏

解题思路:

解题思路 我的解题思路好像是全网目前知道的唯一一个哦~~ 思考这题时,想到了那道 Candy 题.  那道扫描两遍.这题可不可以也扫描两遍呢? 答案是可以的.从左往右以当前bar i 为左bar,直到找比它大的bar j .如果找到,就算出两者的trap water.然后令i:=j,继续搜完. 从右往左同理的方式搜寻(其实就是把第一遍的每个bar当做右bar).不过这里

题目描述:

描述Given a list, rotate the list to the right bykplaces, wherekis non-negative.2.2 单链表 45For example: Given1->2->3->4->5->nullptrandk = 2, return 4->5->1->2->3->nullptr.分析先遍历一遍，得出链表长度len，注意k可能大于len，因此令

描述 Given a linked list and a valuex, partition it such that all nodes less than xcome before nodes greater than or equal tox. You should preserve the original relative order of the nodes in each

描述 Reverse a linked list from positionmto n. Do it in-place and in one-pass. For example: Given1->2->3->4->5->nullptr, m= 2 andn= 4, return1->4->3->2->5->nullptr. Note: Given m, n satisfy the foll

题目描述: The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n representing the total number of bits in the code, print t

题目描述: The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, We get the following sequence (ie, for n = 3): "123""132""21

题目描述: Given an array of integers, every element appears three times except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it with

题目描述: Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive elements sequence is [

题目描述 Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowes