Commit 02dfa7f

committed

Add solution to 47.

1 parent 11a5a71 commit 02dfa7fCopy full SHA for 02dfa7f

File tree

+48

-0

lines changed

+48

-0

lines changed

Lines changed: 48 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,48 @@`
	`1`	`+/**`
	`2`	`+ * @param {number[]} nums`
	`3`	`+ * @return {number[][]}`
	`4`	`+ */`
	`5`	`+var permuteUnique = function (nums) {`
	`6`	`+ const frequency = {};`
	`7`	`+`
	`8`	`+ for (let i = 0; i < nums.length; i++) {`
	`9`	`+ if (frequency[nums[i]] === undefined) {`
	`10`	`+ frequency[nums[i]] = 1;`
	`11`	`+ } else {`
	`12`	`+ frequency[nums[i]]++;`
	`13`	`+ }`
	`14`	`+ }`
	`15`	`+`
	`16`	`+ const results = [];`
	`17`	`+ const n = nums.length;`
	`18`	`+ const combination = [];`
	`19`	`+`
	`20`	`+ backtrack(combination, n, results, frequency);`
	`21`	`+`
	`22`	`+ return results;`
	`23`	`+};`
	`24`	`+`
	`25`	`+function backtrack(combination, n, results, frequency) {`
	`26`	`+ if (combination.length === n) {`
	`27`	`+ results.push(Array.from(combination));`
	`28`	`+ return;`
	`29`	`+ }`
	`30`	`+`
	`31`	`+ for (let [num, counter] of Object.entries(frequency)) {`
	`32`	`+ if (counter === 0) {`
	`33`	`+ continue;`
	`34`	`+ }`
	`35`	`+`
	`36`	`+ combination.push(num);`
	`37`	`+ frequency[num]--;`
	`38`	`+`
	`39`	`+ backtrack(combination, n, results, frequency);`
	`40`	`+`
	`41`	`+ combination.pop();`
	`42`	`+ frequency[num]++;`
	`43`	`+ }`
	`44`	`+}`
	`45`	`+`
	`46`	`+const a = permuteUnique([1, 1, 2]);`
	`47`	`+`
	`48`	`+console.log(a);`

Comments

(0)