substr时间复杂度
时间: 2023-10-25 21:27:00 浏览: 102
substr函数的时间复杂度为O(n),其中n是要查找字符串的长度。这是因为substr函数需要遍历整个要查找的字符串来获取指定位置和长度的子串。因此,substr函数的时间复杂度是线性的。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* [字符串哈希算法](https://blog.csdn.net/Sti1lWater/article/details/120958567)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_2"}}] [.reference_item style="max-width: 50%"]
- *2* *3* [字符串匹配之KMP讲解 及 与C++string类中的substr()的时间复杂度比较](https://blog.csdn.net/m0_61409183/article/details/126267256)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_2"}}] [.reference_item style="max-width: 50%"]
[ .reference_list ]