leetcode 解题思路

In universe EarthC-137, Rick discovered a special form of magnetic force betweentwo balls if they are put in his new invented basket. Rick hasnempty baskets, theithbasket is atposition[i], Morty hasmballs and needs to distribute the balls into the...

Given an integer arraybloomDay, an integermand an integerk.We need to makembouquets. To make a bouquet,you need to usekadjacent flowersfrom the garden.The garden consists ofnflowers, theithflower will bloom in thebloomDay[i]and then can...

You have one chocolate bar that consists of some chunks. Each chunk has its own sweetness given by the arraysweetness.You want to share the chocolate with yourKfriends so you start cutting the chocolate bar intoK+1pieces usingKcuts, each piece con...

On a horizontal number line, we have gas stations at positionsstations[0], stations[1], ..., stations[N-1], whereN = stations.length.Now, we addKmore gas stations so thatD, the maximum distance...

Given an array which consists of non-negative integers and an integerm, you can split the array intomnon-empty continuous subarrays. Write an algorithm to minimize the largest sum among thesemsub...

Thei-th package on the conveyor belt has a weight ofweights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given byweights). We may not load more weight than the m...

Given an array with positive and negative numbers, find themaximum average subarraywhich length should be greater or equal to given lengthk.ExampleExample 1:Input:[1,12,-5,-6,50,3]3Output...

Given an arraynumscontainingn + 1integers where each integer is between1andn(inclusive), guarantee that at least one duplicate number must exist. Assume that there is only one duplicate number...

Givennbooks and each book has the same number of pages. There arekpersons to copy these books and thei-thperson needstimes[i]minutes to copy a book.Each person can copy any number of books a...

Givennbooks and thei-thbook haspages[i]pages. There arekpersons to copy these books.These books list in a row and each person can claim a continous range of books. For example, one copier ca...

Given n pieces of wood with lengthL[i](integer array). Cut them into small pieces to guarantee you could have equal or more than k pieces with the same length. What is the longest length you can get...

二分答案是binary search里面比较难的题型，也就是，直接求一个最值很难，但是我们可以很简单的在解空间做判定性问题，比如能不能，行不行，大了还是小了，return true or false，从而缩小解空间，记住，这种方法有个前提条件就是有单调递增或者递减的性质，才能用。这也是binary search使用的条件；Wood Cut有一些原木，现在想把这些木头切割成一些长度相同的小段...