53 在排序数组中查找数字

最新推荐文章于 2023-12-27 00:15:00 发布

北半球的年少时光

最新推荐文章于 2023-12-27 00:15:00 发布

阅读量110

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/coder_my_lover/article/details/105339117

版权

剑指offer 专栏收录该内容

57 篇文章 0 订阅

订阅专栏

package sort;

public class Test53 {

   public static void main(String[] args) {

       int[] s = { 1, 2, 3, 3, 3, 3, 3, 4, 5, 6 };
       System.out.println(getLast(s, 3, 0, s.length - 1)
               - getFirst(s, 3, 0, s.length - 1) + 1);
   }

public static int getFirst(int[] a, int key, int from, int to) {

       int mid = (from + to) >>> 1;
       if (a[mid] == key) {
           if (mid == 0 || a[mid - 1] != key)
               return mid;
           else {
               to = mid - 1;
           }

       }
       if (a[mid] < key) {
           from = mid + 1;

}
if (a[mid] > key) {

           to = mid - 1;
       }
       return getFirst(a, key, from, to);
   }

   public static int getLast(int[] a, int key, int from, int to) {
       int mid = (from + to) >>> 1;
       if (a[mid] == key) {
           if (mid == a.length - 1 || a[mid + 1] != key) {
               return mid;

           } else {
               from = mid + 1;
           }
       }
       if (a[mid] > key) {
           to = mid - 1;
       }
       if (a[mid] < key) {
           from = mid + 1;
       }
       return getLast(a, key, from, to);
   }
}