codewars,js实现4kyu:recoverasecretstringfromrandomtriplets

该kata的链接地址: link.

There is a secret string which is unknown to you. Given a collection of random triplets from the string, recover the original string.

A triplet here is defined as a sequence of three letters such that each letter occurs somewhere before the next in the given string. “whi” is a triplet for the string “whatisup”.

As a simplification, you may assume that no letter occurs more than once in the secret string.

You can assume nothing about the triplets given to you other than that they are valid triplets and that they contain sufficient information to deduce the original string. In particular, this means that the secret string will never contain letters that do not occur in one of the triplets given to you.

secret1 &＃61; "whatisup"
triplets1 &＃61; [[&＃39;t&＃39;,&＃39;u&＃39;,&＃39;p&＃39;],[&＃39;w&＃39;,&＃39;h&＃39;,&＃39;i&＃39;],[&＃39;t&＃39;,&＃39;s&＃39;,&＃39;u&＃39;],[&＃39;a&＃39;,&＃39;t&＃39;,&＃39;s&＃39;],[&＃39;h&＃39;,&＃39;a&＃39;,&＃39;p&＃39;],[&＃39;t&＃39;,&＃39;i&＃39;,&＃39;s&＃39;],[&＃39;w&＃39;,&＃39;h&＃39;,&＃39;s&＃39;]
]Test.assertEquals(recoverSecret(triplets1), secret1)

代码实现

我完成代码

var recoverSecret &＃61; function(triplets) {let newStr &＃61; Array.from(new Set (triplets.join(&＃39;,&＃39;).split(&＃39;,&＃39;))).join(&＃39;&＃39;) ;let flag &＃61; true;while(flag){flag &＃61; false;triplets.forEach((item,index) &＃61;> {for(let i &＃61; 0;i < 2;i&＃43;&＃43;) {if(newStr.indexOf(item[i]) > newStr.indexOf(item[i&＃43;1])){newStr &＃61; newStr.replace(item[i],item[i&＃43;1]).replace(item[i&＃43;1],item[i]);flag &＃61; true;}} } }return newStr}

解题思路
难点