题目

给出不同长度的木头[232,114,258]，从中切出K段长度相同木头，所切的木头要为能切取的最长长度。返回切取木头的长度。

• 示例1
  [232,114,258] K=1
  输出：258
• 示例2
  [232,114,258] K=5
  输出：114

题解

public class WoodCut {
   
    public static void main(String[] args) {
   
        int[] L={
   232,124,456};
        int i = woodCut(L, 7);
        System.out.println(i);
    }
    public static int woodCut(int[] L,int K){
   
        int start = 1;
        int end = getMax(L);
        int mid;
        while(start+1<end){
   
            mid = start + (end - start)/2;
            int pieces = getPieces(L,mid);
            if(pieces>=K){
   
                start = mid;
            }else{
   
                end = mid;
            }
        }
        if(getPieces(L,start)>=K){
   
            return start;
        }
        if(getPieces(L,end)>=K){
   
            return end;
        }
        return 0;
    }

    private static int getPieces(int[] L, int mid) {
   
        int pieces = 0;
        for (int value : L) {
   
            pieces += value / mid;
        }
        return pieces;
    }

    private static int getMax(int[] L) {
   
        int max = L[0];
        for(int i=0;i<L.length;i++){
   
            if(max<L[i]){
   
                max = L[i];
            }
        }
        return max;
    }
}