int i, j, k = 0; for (i = n / 2; i <= n; i++) { for (j = 2; j <= n; j += j) { k = k + n / 2; } }
O(n)
O(n * log(n))
O(n^2)
O(n^2 * log(n))
这道题你会答吗?花几分钟告诉大家答案吧!
扫描二维码,关注牛客网
下载牛客APP,随时随地刷题