LT 183 wood cut

2021-06-18 07:34:01 阅读：220 来源： 互联网

标签：cut return int length pieces 183 LT wood

/*
Given n pieces of wood with length L[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 from the n pieces of wood? Given L & k, return the maximum length of the small pieces.

Example

Example 1

Input:

L = [232, 124, 456]

k = 7

Output: 114

Explanation: We can cut it into 7 pieces if any piece is 114cm long, however we can't cut it into 7 pieces if any piece is 115cm long.

Example 2

Input:

L = [1, 2, 3]

k = 7

Output: 0

Explanation: It is obvious we can't make it.*/

public class Solution {
    /** 
     *@param L: Given n pieces of wood with length L[i]
     *@param k: An integer
     *return: The maximum length of the small pieces.
     */
    public int woodCut(int[] L, int k) {
        // write your code here
        
        if (L == null || L.length == 0 || k <= 0) {
            return 0;
        }
        
        int start = 1;
        int end = 1;
        for (int wood : L) {
            end = Math.max(wood, end);
        }
        
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (getPieces(L, mid) >= k) {
                start = mid;
            }
            else {
                end = mid;
            }
        }
        
        if (getPieces(L, end) >= k) {
            return end;
        }
        if (getPieces(L, start) >= k) {
            return start;
        }
        return 0;
    }
    
    public int getPieces(int[] L, int length) {
        int count = 0;
        for (int wood : L) {
            count += wood / length;
        }
        return count;
    }
}

Analysis:
Binary search for the result. The min length is 1, and the max length is the Max(L[i]). So we can try every possible length and calculate how many pieces can we cut? If the number is greater than k, means the the number we tried might be too small. Otherwise, the number is too large. So we can do it via binary search. The total time complexity would be O(nlogAns)

http://buttercola.blogspot.com/2019/03/lintcode-183-wood-cut.html

标签：cut,return,int,length,pieces,183,LT,wood
来源： https://www.cnblogs.com/wentiliangkaihua/p/14898022.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9

LT 183 wood cut