c++之数组篇1：对排序数组找出指定数字出现的次数

//本文来自《程序员面试笔试宝典》何昊等人编著 #include <iostream> //using namespace std; int BS(int *a,int length,int num,bool isLeft) { int left = 0; int right = length - 1; int last = -1; while(left <= right) { in

>>阅读原文<<