课程: Level Up: JavaScript

今天就学习课程吧！

今天就开通帐号，24,700 门业界名师课程任您挑！

String permutation

String permutation - JavaScript教程

课程: Level Up: JavaScript

开始一个月试用 购买团队方案

String permutation

“

(lively game music) - Recursion is when a function calls itself with an argument that gets progressively smaller and smaller until a base case is reached. Once that base case is reached, the previous stack of executions, returns and your solution is calculated. (lively music) Suppose you're playing Scrabble with your best friend and you want to know how many possible combinations of letters you can make with the letters you have. Create a recursive function that takes in a string of letters and calculates the number of possible combinations you can play. Calculating the number of possible combinations of a set of values is known as a factorial. We achieve a factorial solution by starting with the total number of items in the set and multiplying it by each proceeding number of values until we reach one. Pause the video here, develop your solution and when you're ready, come back and I'll walk you through how I solved the…

内容