在O（1）的時(shí)間內(nèi)計(jì)算n個(gè)整數(shù)落在區(qū)間[a,b]的個(gè)數(shù)

預(yù)處理時(shí)間為O（n+k)
算法導(dǎo)論第三版8.2-4題

int find_inverter_count(int *array,int length,int maximum,int inverter_left,int inverter_right) {if(inverter_left<0 || inverter_right>maximum || inverter_right<inverter_left){perror("inverter error");return -1;}int *count_array = new int[maximum+1];for (int i = 0; i < maximum+1; ++i) {count_array[i] = 0;}for (int i = 0; i < length; ++i) {count_array[array[i]] = count_array[array[i]] + 1;}for (int i = 1; i < maximum+1; ++i) {count_array[i] = count_array[i] + count_array[i-1];}int count = 0;if(inverter_left == 0)count = count_array[inverter_right];elsecount = count_array[inverter_right] - count_array[inverter_left - 1];delete [] count_array;return count; } 創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎(jiǎng)勵(lì)來咯，堅(jiān)持創(chuàng)作打卡瓜分現(xiàn)金大獎(jiǎng)

總結(jié)

以上是生活随笔為你收集整理的在O（1）的时间内计算n个整数落在区间[a,b]的个数(预处理时间为O（n+k))的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。