zoukankan      html  css  js  c++  java
  • 1657. 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
    • 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.

    Example 1:

    Input: word1 = "abc", word2 = "bca"
    Output: true
    Explanation: You can attain word2 from word1 in 2 operations.
    Apply Operation 1: "abc" -> "acb"
    Apply Operation 1: "acb" -> "bca"
    

    Example 2:

    Input: word1 = "a", word2 = "aa"
    Output: false
    Explanation: It is impossible to attain word2 from word1, or vice versa, in any number of operations.
    

    Example 3:

    Input: word1 = "cabbba", word2 = "abbccc"
    Output: true
    Explanation: You can attain word2 from word1 in 3 operations.
    Apply Operation 1: "cabbba" -> "caabbb"
    Apply Operation 2: "caabbb" -> "baaccc"
    Apply Operation 2: "baaccc" -> "abbccc"
    

    Example 4:

    Input: word1 = "cabbba", word2 = "aabbss"
    Output: false
    Explanation: It is impossible to attain word2 from word1, or vice versa, in any amount of operations.
    

    Constraints:

    • 1 <= word1.length, word2.length <= 105
    • word1 and word2 contain only lowercase English letters.
    class Solution {
        public boolean closeStrings(String word1, String word2) {
            if(word1.length() != word2.length()) return false;
            int[] freq1 = new int[26];
            int[] freq2 = new int[26];
            
            Set<Character> wd1 = new HashSet();
            Set<Character> wd2 = new HashSet();
            
            for(char c : word1.toCharArray()) {
                freq1[c - 'a']++;
                wd1.add(c);
            }
            
            for(char c : word2.toCharArray()) {
                freq2[c - 'a']++;
                wd2.add(c);
            }
            Arrays.sort(freq1);
            Arrays.sort(freq2);
            for(int i = 0; i < freq1.length; i++) {
                if(freq1[i] != freq2[i]) return false;
            }
            
            return wd1.equals(wd2);
        }
    }

    有什么特征?

    所包含的字母种类必须相同,频率也相同。

  • 相关阅读:
    maven安装和四大特性
    rabbitMQ的安装和创建用户
    java小白之面向对象
    java初级笔记
    laravel 的升级
    prepare
    获取客户端真实IP
    apache nginx 区别
    七猫面试
    linux基本命令
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/14316740.html
Copyright © 2011-2022 走看看