js版数据结构与算法—2.2反转单词原理讲解

短命女 2022-02-05 03:07 189阅读 0赞

# 1.简单算法 #

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ppYW9qc3Vu_size_16_color_FFFFFF_t_70][]

# 2.字符串 #

# ![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ppYW9qc3Vu_size_16_color_FFFFFF_t_70 1][]  #

题目一

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ppYW9qc3Vu_size_16_color_FFFFFF_t_70 2][] 思路：a.字符串变成数组。b.每个单词反转

string.js(以下是两种写法)

export default (str) => {
      // 字符串按空格进行分隔，保存数组，数组的元素的先后顺序就是单词的顺序
      let arr = str.split(' ')
      // 对数组进行遍历，然后每个元素进行反转
      let result = arr.map(item => {
        return item.split('').reverse().join('')
      })
      return result.join(' ')
    }
    
    export default (str) => {
      // 1. 字符串按空格进行分隔，保存数组，数组的元素的先后顺序就是单词的顺序
      // 2. 对数组进行遍历，然后每个元素进行反转
      return str.split(' ').map(item => {
        return item.split('').reverse().join('')
      }).join(' ')
    }

test.js

import revertByWorld from '../../code/string/lesson1'
    
    test('revertByWorld:Let\'s take LeetCode contest', () => {
      expect(revertByWorld("Let's take LeetCode contest")).toBe("s'teL ekat edoCteeL tsetnoc")
    })

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ppYW9qc3Vu_size_16_color_FFFFFF_t_70]: /images/20220205/0b3da36175fe42d0a085f1a8fb7e25cf.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ppYW9qc3Vu_size_16_color_FFFFFF_t_70 1]: /images/20220205/b786b1ab22e148aca1d6a775819b568d.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2ppYW9qc3Vu_size_16_color_FFFFFF_t_70 2]: /images/20220205/cb303b07eb6c4cfbb8f4ca88dc28d612.png