andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge pull request #47 from jussisaurio/anagrams-functional

Browse Source 
Make "Anagrams of string" fully functional
This commit is contained in:
Angelos Chalaris
2017-12-13 12:37:49 +02:00
committed by GitHub
parent 4569c18ad6 3bef1644ca
commit fdc872b7a1
2 changed files with 3 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
README.md
View File

@ -74,8 +74,7 @@ Base cases are for string `length` equal to `2` or `1`.
const anagrams = str => { const anagrams = str => {
if(str.length <= 2) return str.length === 2 ? [str, str[1] + str[0]] : [str]; if(str.length <= 2) return str.length === 2 ? [str, str[1] + str[0]] : [str];
return str.split('').reduce( (acc, letter, i) => { return str.split('').reduce( (acc, letter, i) => {
anagrams(str.slice(0, i) + str.slice(i + 1)).map( val => acc.push(letter + val) ); return acc.concat(anagrams(str.slice(0, i) + str.slice(i + 1)).map( val => letter + val ));
return acc;
}, []); }, []);
} }
// anagrams('abc') -> ['abc','acb','bac','bca','cab','cba'] // anagrams('abc') -> ['abc','acb','bac','bca','cab','cba']

6
snippets/anagrams-of-string-(with-duplicates).md
View File

@ -8,10 +8,8 @@ Base cases are for string `length` equal to `2` or `1`.
```js ```js
const anagrams = str => { const anagrams = str => {
if(str.length <= 2) return str.length === 2 ? [str, str[1] + str[0]] : [str]; if(str.length <= 2) return str.length === 2 ? [str, str[1] + str[0]] : [str];
return str.split('').reduce( (acc, letter, i) => { return str.split('').reduce( (acc, letter, i) =>
anagrams(str.slice(0, i) + str.slice(i + 1)).map( val => acc.push(letter + val) ); acc.concat(anagrams(str.slice(0, i) + str.slice(i + 1)).map( val => letter + val )), []);
return acc;
}, []);
} }
// anagrams('abc') -> ['abc','acb','bac','bca','cab','cba'] // anagrams('abc') -> ['abc','acb','bac','bca','cab','cba']
``` ```