next_permutation时间复杂度

next_permutation时间复杂度为O(N)，其中N为输入数组的长度。这是因为next_permutation函数的主要操作是找到第一个顺序对并进行替换，然后对替换位置右侧的降序列进行整体逆序操作。在最坏情况下，需要遍历整个数组，因此时间复杂度为O(N)。同时，该算法在原地进行操作，不需要额外的空间复杂度。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* [生成全排列----std::next_permutation 算法解析](https://blog.csdn.net/Dylan_Frank/article/details/79532760)[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^v92^chatsearchT3_1"}}] [.reference_item style="max-width: 50%"]
- *2* *3* [LeetCode - 解题笔记 - 31 - Next Permutation](https://blog.csdn.net/cary_leo/article/details/114631189)[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^v92^chatsearchT3_1"}}] [.reference_item style="max-width: 50%"]
[ .reference_list ]