JS Algorithm Tutorial: String Deduplication and String Inversion

1. Deduplication of strings

When it comes to string deduplication, we will think of array deduplication at the first time, so we can convert the string into an array, and then deduplicate the array. After deduplication is finished, we will splice it into a string. Here are two methods of deduplication. Let’s look at the code.

The first method:

Logical steps:

1. Use split or ES6 expansion operator... to cut the string into an array

2. Use ES6's Set data to deconstruct, it is similar to an array, but its member values ​​are unique, and use new to create

3. Use join splicing for the deduplication array

let str = '11223344aabbcc'
function strSeparate(s) {
 return [...new Set([...s])].join('');
 // or return [...new Set((''))].join('')
}
(strSeparate(str))

The second method:

Logical steps:

The logical steps of the second method are different from the logical steps of the first method. Steps 1 and 3 are both converting the string into an array, deduplication of the array, and then splicing it into a string.

function strSeparate(s) {
 // Use the expand operator to convert the string into an array s = ...str;
 let arr = [];
 for(let i = 0; i < ; i++) {
  if((s[i]) == -1) {
   (s[i])
  }
 }
 return ('');
}

2. String inversion

Anyway, the easiest thing I can think of is to use the reverse method of the array, so you still need to cut the string into an array, then reverse the array, and then splice it.

let str = 'abcdefg'
function strReverse(s) {
 return [...s].reverse().join('');
}
// or
function reverse(s) {
 return ('').reverse().join('');
}

As for the many ways to turn strings, I have read them a lot online. At present, I still think the above two are the simplest. If you have any better methods, you can leave a message or send it privately. We will learn from each other.

Summarize

This is the article about string deduplication and string inversion in JS algorithm tutorial. This is all about this. For more related JS string deduplication and inversion content, please search for my previous articles or continue browsing the related articles below. I hope everyone will support me in the future!