下面 count_triple 函数的时间复杂度为( )。
nt count_triple(int n) {\tint cnt = 0;\tfor (int a = 1; a <= n; a )\t\tfor (int b = a; a b <= n; b )\t\t\tfor (int c = b; a b c <= n; c )\t\t\t\tif (a * a b * b == c * c)\t\t\t\t\tcnt ;\treturn cnt;}
O(N)
O(N2)
O(N3)
O(N4)
微信小程序
微信扫一扫体验
微信公众账号
微信扫一扫加关注
发表评论 取消回复