Created
July 24, 2017 16:45
-
-
Save betterkenly/d22b14e5398219426201092c71763150 to your computer and use it in GitHub Desktop.
test
This file contains hidden or 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
var isSubsequence = function(s, t) { | |
s = s.split(''); | |
t = t.split(''); | |
var curr = 0; | |
var temp = 0; | |
for (var i = 0; i < s.length; i++) { | |
var temp2 = temp; | |
for (var j = temp2; j < t.length; j++) { | |
if (t[j] === s[i]) { | |
temp = j | |
} | |
} | |
if (temp2 !== temp && j === t.length) { | |
return false; | |
} | |
} | |
return true; | |
}; | |
var frequencySort = function(s) { | |
var result = []; | |
var processed = []; | |
var final = ''; | |
for (var i = 0; i < s.length; i++) { | |
if (processed.indexOf(s[i]) === -1) { | |
processed.push(s[i]); | |
result.push([s[i],1]); | |
} else { | |
for (var j = 0; j < result.length; j++) { | |
if (result[j][0] === s[i]) { | |
result[j][1] ++; | |
} | |
} | |
} | |
} | |
var sorted = result.sort((a,b) => { | |
if (a[1] > b[1]) { | |
return - 1; | |
} else if (a[1] < b[1]) { | |
return 1; | |
}else { | |
return 0; | |
} | |
}); | |
for (var k = 0; k < sorted.length; k++) { | |
var limit = sorted[k][1]; | |
while(limit > 0) { | |
final+= sorted[k][0]; | |
limit--; | |
} | |
} | |
return final; | |
}; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment