/**
 * @author Aaron
 * @since 6.2
 */
public class TheFirstLessThan100 {
    public static int find(int[] array, int value) {

        int low = 0;
        int high = array.length - 1;
        int count = 0;
        while (low <= high) {
            int middle = (low + high) >>> 1;
            int middleValue = array[middle];
            count++;
            if (middleValue < value) {
                low = middle + 1;
            } else if (middleValue > value) {
                high = middle - 1;
            } else {
                System.out.printf("times:%d,index:%d,value:%d\n", count, middle, value);
                return middle;
            }
        }
        return -1;
    }


    public static void main(String[] args) {
        int[] array = new int[]{1, 2, 3, 4, 5, 6, 7, 7, 7, 7, 8, 9, 10, 14, 17, 19, 20};
        for (int i = 0; i < array.length; i++) {
            int index = find(array, array[i]);
        }
    }
}

public static int findFirstBigIndex(int[] array, int value) {

        int lastBigIndex=-1;

        int low = 0;
        int high = array.length - 1;
        int count = 0;

        while (low <= high) {
            int middle = (low + high) >>> 1;
            int middleValue = array[middle];
            count++;
            if (middleValue <= value) {
                low = middle + 1;
            } else if (middleValue > value) {
                high = middle - 1;
                lastBigIndex=middle;
                System.out.printf("times:%d,index:%d,value:%d,middle:%d\n", count, middle, value,middleValue);
            }
        }
        return lastBigIndex;
    }



    public static int findFirstBigIndex1(int[] array, int value) {

        int low = 0;
        int high = array.length - 1;
        int count = 0;

        while (low <= high) {
            int middle = (low + high) >>> 1;
            int middleValue = array[middle];
            count++;
            if (middleValue <= value) {
                low = middle + 1;
            } else if (middleValue > value) {
                high = middle - 1;
                System.out.printf("times:%d,index:%d,value:%d,middle:%d\n", count, middle, value,middleValue);
            }
        }
        return low;
    }

    public static void main(String[] args) {
        int[] array = new int[]{1, 2, 3, 4, 5, 6, 8, 9, 10, 14, 17, 19, 20,21,22,34,324,546};
        for (int i = 0; i < array.length; i++) {
            int index = findFirstBigIndex1(array, i);
            int index2 = findFirstBigIndex(array, i);
            System.out.println(index+"--"+index2);
        }
    }

public static List<ImageCell> createMergeCell(int n, int totalWidth) {
      int totalRow = (int) Math.ceil(Math.sqrt(n));
      int outline = 5;
      int width = ((totalWidth - outline) / totalRow);
      int border = width / 20;
      if (n == 1) {
          return Lists.newArrayList(new ImageCell(border, border, width - 2 * border));
      }
      int lastAloneNum = n % totalRow;
      int totalFullRow = n / totalRow;
      int lastRow = totalRow - totalFullRow - 1;

      int firstStartX = (totalWidth - lastAloneNum * width) / 2;
      int firstStartY = lastRow * width;

      int otherSpace = (totalWidth - totalRow * width) / 2;
      int yOffset = 0;
      if (totalRow != totalFullRow + (lastAloneNum != 0 ? 1 : 0)) {
          yOffset = -width / 2;
      }
      List<ImageCell> imageCells = Lists.newArrayList();
      for (int i = 0; i < n; i++) {
          int x = 0, y = firstStartY;
          if (i < lastAloneNum) {
              x = firstStartX + i * width;
          } else {
              x = (i - lastAloneNum) % totalRow * width;
              y = firstStartY + ((i - lastAloneNum) / totalRow + 1) * width;
          }
          imageCells.add(new ImageCell(x + border + otherSpace, y + border + otherSpace + yOffset, width - 2 * border));
      }
      return imageCells;
  }

  @Data
  @AllArgsConstructor
  static class ImageCell {
      int x;
      int y;
      int width;

  }