Example Analysis of FCC algorithm in js

This article mainly introduces the example analysis of FCC algorithm in js, which is very detailed and has certain reference value. Friends who are interested must finish it!

Rearranges the characters in a string to generate a new string and returns the number of strings in the newly generated string with no consecutive repeating characters. Continuous repetition is based on a single character only

For example, aab should return 2 because it has a total of 6 permutations (aab, aab, aba, aba, baa, baa), but only two (aba and aba) do not have consecutive repeated characters (an in this case).

I got some ideas from the online materials, my code:

Function permAlone (str) {var arr=str.split ("); var perarr= []; var begin=0; / / create regular, if the string is all duplicated, then directly return 0 var reg = / (.)\ 1swap g; if (str.match (reg)! = = null&&str.match (reg) [0] = str) {return 0;} / / function for exchange function swap (idx1,idx2) {var temp=arr [idx1]; arr [idx1] = arr [idx2]; arr [idx2] = temp } / / if begin reaches the last character, you can add this string to the fully arranged array function permall (arr,begin) {if (begin==arr.length-1) {perarr [perarr.length] = arr.join (""); return;} for (var item0; (i+begin))