Title: leetcode47-全排列II | snmlm
Open Graph Title: leetcode47-全排列II
Description: 题目描述给定一个可包含重复数字的序列 nums ,**按任意顺序** 返回所有不重复的全排列。 示例 1: 12345输入:nums = [1,1,2]输出:[[1,1,2], [1,2,1], [2,1,1]] 示例 2: 12输入:nums = [1,2,3]输出:[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] 提示: 1 <
Open Graph Description: 题目描述给定一个可包含重复数字的序列 nums ,**按任意顺序** 返回所有不重复的全排列。 示例 1: 12345输入:nums = [1,1,2]输出:[[1,1,2], [1,2,1], [2,1,1]] 示例 2: 12输入:nums = [1,2,3]输出:[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] 提示: 1 <
Keywords:
Mail addresses
undefined
Opengraph URL: https://snmlm.github.io/algorithm/leetcode/leetcode_47/
Generator: Hexo 5.1.1
Domain: snmlm.github.io
| None | no-siteapp |
| author | snmlm |
| copyright | snmlm |
| format-detection | telephone=no |
| theme-color | #ffffff |
| og:type | article |
| og:site_name | snmlm |
| og:image | https://snmlm.github.io/img/head.gif |
| article:published_time | 2023-05-22T16:00:00.000Z |
| article:modified_time | 2023-05-23T08:30:31.908Z |
| twitter:card | summary |
Links:
Viewport: width=device-width,initial-scale=1