LintCode-Copy Books
Posted mfmdaoyou
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LintCode-Copy Books相关的知识,希望对你有一定的参考价值。
Given an array A of integer with size of n( means n books and number of pages of each book) and k people to copy the book. You must distribute the continuous id books to one people to copy. (You can give book A[1],A[2] to one people, but you cannot give book A[1], A[3] to one people, because book A[1] and A[3] is not continuous.) Each person have can copy one page per minute. Return the number of smallest minutes need to copy all the books.
您在真实的面试中是否遇到过这个题?Given array A = [3,2,4]
,
k = 2
.
Return 5
( First person
spends 5 minutes to copy book 1 and book 2 and second person spends 4 minutes to copy book 3. )
Could you do this in O(n*k)
time
?
class Solution { public: /** * @param pages: a vector of integers * @param k: an integer * @return: an integer */ int copyBooks(vector<int> &pages, int k) { // write your code here int l = 0; int r = 99999999; while(l<r) { int mid = (l+r)/2; if(check(mid,pages,k)) { r = mid; } else l = mid+1; } return l; } bool check(int index,vector<int>& pages,int k) { int cnt = 0; int sum = 0; int i = 0; while(i<pages.size()) { if(sum+pages[i]<=index) { sum+=pages[i++]; } else if(pages[i]<=index) { cnt++; sum = 0; } else return false; } if(sum!=0) cnt++; return cnt<=k; } };
以上是关于LintCode-Copy Books的主要内容,如果未能解决你的问题,请参考以下文章
例题 8-10 UVA - 714 Copying Books