Try   HackMD

1657. Determine if Two Strings Are Close

題目位置

https://leetcode.com/problems/determine-if-two-strings-are-close

題目描述

Two strings are considered close if you can attain one from the other using the following operations:

如果我們可以使用下面兩種操作, 將其中一個字串轉變為另外一個字串

Operation 1: Swap any two existing characters.

  • For example, abcde -> aecdb

交換兩個存在的字元, 例如 abcde -> aecdb

Operation 2: Transform every occurrence of one existing character into another existing character, and do the same with the other character.

  • For example, aacabb -> bbcbaa (all a's turn into b's, and all b's turn into a's) You can use the operations on either string as many times as necessary.

Given two strings, word1 and word2, return true if word1 and word2 are close, and false otherwise.