摘要：
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). F 阅读全文
posted @ 2020-08-13 02:44
little_veggie
阅读(112)
评论(0)
推荐(0)
摘要：
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]). Y 阅读全文
posted @ 2020-08-12 14:49
little_veggie
阅读(89)
评论(0)
推荐(0)
摘要：
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). Y 阅读全文
posted @ 2020-08-12 14:00
little_veggie
阅读(86)
评论(0)
推荐(0)
摘要：
Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible. Note: The l 阅读全文
posted @ 2020-08-12 10:04
little_veggie
阅读(111)
评论(0)
推荐(0)
摘要：
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the hist 阅读全文
posted @ 2020-08-12 05:31
little_veggie
阅读(86)
评论(0)
推荐(0)
摘要：
A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are give 阅读全文
posted @ 2020-08-11 03:51
little_veggie
阅读(79)
评论(0)
推荐(0)
摘要：
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo 阅读全文
posted @ 2020-08-10 13:13
little_veggie
阅读(150)
评论(0)
推荐(0)
摘要：
Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target. 阅读全文
posted @ 2020-08-09 11:54
little_veggie
阅读(81)
评论(0)
推荐(0)
摘要：
Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numb 阅读全文
posted @ 2020-08-09 05:29
little_veggie
阅读(98)
评论(0)
推荐(0)
摘要：
Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the 阅读全文
posted @ 2020-08-09 04:44
little_veggie
阅读(92)
评论(0)
推荐(0)
浙公网安备 33010602011771号