更新时间:1970-01-01 07:57:18
空间复杂度O(2n)其中n是字符串缓冲区大小。
时间复杂度为O(m),其中m是字符串的实际大小。
BTW,如果分配了字符串会发生什么缓冲区长度超过49个字符?
干杯!
The space complexity O(2n) where n is the string buffer size.
The time complexity is O(m) where m is the actual size of the string.
BTW, what will happen if the string assigned to the buffer is more than 49 characters long?
Cheers!
如果你安装了Visual Studio Team System它随附代码复杂性分析工具。有许多免费工具可供代码复杂性分析试试这个一个 [ ^ ]或 google [ ^ ]它用于更多工具。
If you have Visual Studio Team System Installed it comes with Code Complexity Analysis tools. there are many free tools available for code complexity analysis try this one[^] or google [^] it for more tools.