litana

摘要： 折半查找：class Solution {public: int searchInsert(int A[], int n, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function if( n <= 0 ) { return 0; } int low = 0; int high = n-1; while( low <... 阅读全文