摘要: 二分法溢出的情况: public int guessNumber(int n) { int leftP = 1; int rightP = n; int mid = 0; while(leftP < rightP){ //皆是因为mid = (rightP + leftP) /2; mid = le 阅读全文
posted @ 2022-10-01 20:13 main(void) 阅读(39) 评论(0) 推荐(0) 编辑
.c_ad_block { display: none !important; } #ad_t2{ display: none !important; }