Last active
July 27, 2018 16:56
-
-
Save dusanmarsa/a1136955d5d09c8f6ec4a12b98ba3666 to your computer and use it in GitHub Desktop.
Create string sequence using recursion.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const nextInSequence = (last, initLength = 5) => { | |
| let seq = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"] | |
| last = last.split('').reverse() | |
| let arrShift = arr => { | |
| if(seq.indexOf(arr[0]) >= seq.length - 1) { | |
| arr.shift() | |
| } | |
| if(seq.indexOf(arr[0]) < seq.length - 1){ | |
| arr[0] = seq[seq.indexOf(arr[0]) + 1] | |
| return arr | |
| } | |
| return arrShift(arr) | |
| } | |
| return arrShift(last).reverse().join('') + 'a'.repeat(initLength - last.length) | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment