Update 47.permutations-ii.md

Author: azl397985856

problems/47.permutations-ii.md

@@ -61,30 +61,6 @@ https://leetcode-cn.com/problems/permutations-ii/
  * @lc app=leetcode id=47 lang=javascript
  *
  * [47] Permutations II
- *
- * https://leetcode.com/problems/permutations-ii/description/
- *
- * algorithms
- * Medium (39.29%)
- * Total Accepted:    234.1K
- * Total Submissions: 586.2K
- * Testcase Example:  '[1,1,2]'
- *
- * Given a collection of numbers that might contain duplicates, return all
- * possible unique permutations.
- *
- * Example:
- *
- *
- * Input: [1,1,2]
- * Output:
- * [
- * ⁠ [1,1,2],
- * ⁠ [1,2,1],
- * ⁠ [2,1,1]
- * ]
- *
- *
  */
 function backtrack(list, nums, tempList, visited) {
   if (tempList.length === nums.length) return list.push([...tempList]);