Interview question 01.02. determine whether it is character rearrangement

Title Description

Given two strings s1 and s2, Please write a program , After determining the character rearrangement of one of the strings , Can it be another string .
https://leetcode-cn.com/problems/check-permutation-lcci/

Their thinking

There are three ways to achieve ：

1. Turn it into an array and sort and compare strings
2. Compare value results with object count
3. Convert the string to ASCII Code full plus comparison value

Code implementation

/** * @param {string} s1 * @param {string} s2 * @return {boolean} */
// Three ways to achieve 
//1. Turn it into an array and sort and compare strings // 60 ms 34.1 MB
var CheckPermutation = function(s1, s2) {
    
  let n1=s1.split('').sort().join('');
  let n2=s2.split('').sort().join('');
  return n1===n2;
};
//2. Use object counting //60 ms 34 MB
var CheckPermutation = function(s1, s2) {
    
  if(s1.length!==s2.length){
    
    return false;
  }
  let map={
    };
  for(let i=0;i<s1.length;i++){
    
    map[s1[i]]=(map[s1[i]]||0)+1;
  }
  for(let i=0;i<s2.length;i++){
    
    if(!map[s2[i]]){
    
      return false;
    }else{
    
      map[s2[i]]--;
    }
  }
  return true;
};
//3. Convert the string to ASCII Code full plus comparison value  64 ms 34 MB
var CheckPermutation = function(s1, s2) {
    
  let sum1=0;
  let sum2=0;
  if(s1.length!==s2.length)return false;
  for(let i=0;i<s1.length;i++){
    
    sum1+=s1.charCodeAt(i);
    sum2+=s2.charCodeAt(i);
  }
  return sum1===sum2;
};