mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-06 01:18:23 +08:00
ran standard
This commit is contained in:
@ -1,37 +1,31 @@
|
||||
function permutations(str){
|
||||
|
||||
const createPermutations = (str) => {
|
||||
// convert string to array
|
||||
let arr = str.split(''),
|
||||
const arr = str.split('')
|
||||
|
||||
// get array length
|
||||
len = arr.length,
|
||||
// this will hold all the permutations
|
||||
perms = [],
|
||||
rest,
|
||||
picked,
|
||||
restPerms,
|
||||
next;
|
||||
// get array length
|
||||
const strLen = arr.length
|
||||
// this will hold all the permutations
|
||||
const perms = []
|
||||
let rest
|
||||
let picked
|
||||
let restPerms
|
||||
let next
|
||||
|
||||
// if len is zero, return the same string
|
||||
if (len === 0)
|
||||
return [str];
|
||||
// loop to the length to get all permutations
|
||||
for (let i=0; i<len; i++)
|
||||
{
|
||||
rest = Object.create(arr);
|
||||
picked = rest.splice(i, 1);
|
||||
// if strLen is zero, return the same string
|
||||
if (strLen === 0) { return [str] }
|
||||
// loop to the length to get all permutations
|
||||
for (let i = 0; i < strLen; i++) {
|
||||
rest = Object.create(arr)
|
||||
picked = rest.splice(i, 1)
|
||||
|
||||
restPerms = permutations(rest.join(''));
|
||||
restPerms = createPermutations(rest.join(''))
|
||||
|
||||
for (var j=0, jLen = restPerms.length; j< jLen; j++)
|
||||
{
|
||||
next = picked.concat(restPerms[j]);
|
||||
perms.push(next.join(''));
|
||||
}
|
||||
for (let j = 0, jLen = restPerms.length; j < jLen; j++) {
|
||||
next = picked.concat(restPerms[j])
|
||||
perms.push(next.join(''))
|
||||
}
|
||||
return perms;
|
||||
}
|
||||
return perms
|
||||
}
|
||||
|
||||
console.log(permutations('abc')) // should print ["abc", "acb", "bac", "bca", "cab", "cba"]
|
||||
|
||||
|
||||
console.log(createPermutations('abc')) // should print ["abc", "acb", "bac", "bca", "cab", "cba"]
|
||||
|
Reference in New Issue
Block a user