zoukankan      html  css  js  c++  java
  • LeetCode 839. Similar String Groups

    原题链接在这里:https://leetcode.com/problems/similar-string-groups/

    题目:

    Two strings X and Y are similar if we can swap two letters (in different positions) of X, so that it equals Y. Also two strings X and Y are similar if they are equal.

    For example, "tars" and "rats" are similar (swapping at positions 0 and 2), and "rats" and "arts" are similar, but "star" is not similar to "tars""rats", or "arts".

    Together, these form two connected groups by similarity: {"tars", "rats", "arts"} and {"star"}.  Notice that "tars" and "arts" are in the same group even though they are not similar.  Formally, each group is such that a word is in the group if and only if it is similar to at least one other word in the group.

    We are given a list A of strings.  Every string in A is an anagram of every other string in A.  How many groups are there?

    Example 1:

    Input: A = ["tars","rats","arts","star"]
    Output: 2

    Constraints:

    • 1 <= A.length <= 2000
    • 1 <= A[i].length <= 1000
    • A.length * A[i].length <= 20000
    • All words in A consist of lowercase letters only.
    • All words in A have the same length and are anagrams of each other.
    • The judging time limit has been increased for this question.

    题解:

    For two strings, if they are similar, put into one union find group.

    Eventually, return union find size.

    To check if two string are similar, count the chars that they are different, if res > 2, return false.

    Time Complexity: O(n^2 * (len+logn)). With path compression and rank by weight, amortized time complexity wouldbe O(n^2*len). n = A.length. len = string length.

    Space: O(n*len).

    AC Java:

     1 class Solution {
     2     HashMap<String, String> parent = new HashMap<>();
     3     HashMap<String, Integer> size = new HashMap<>();
     4     int count;
     5     
     6     public int numSimilarGroups(String[] A) {
     7         for(String s : A){
     8             parent.put(s, s);
     9             size.put(s, 1);
    10         }
    11         
    12         count = parent.size();
    13         
    14         int n = A.length;
    15         for(int i = 0; i < n; i++){
    16             for(int j = i + 1; j < n; j++){
    17                 if(A[i].equals(A[j])){
    18                     continue;
    19                 }
    20                 
    21                 if(isLegal(A[i], A[j])){
    22                     if(!find(A[i], A[j])){
    23                         union(A[i], A[j]);
    24                     }
    25                 }
    26             }
    27         }
    28         
    29         return count;
    30     }
    31     
    32     private boolean isLegal(String s, String t){
    33         if(s.length() != t.length()){
    34             return false;
    35         }
    36         
    37         int res = 0;
    38         for(int i = 0; i < s.length(); i++){
    39             if(s.charAt(i) != t.charAt(i)){
    40                 res++;
    41                 if(res > 2){
    42                     return false;
    43                 }
    44             }
    45         }
    46         
    47         return true;
    48     }
    49     
    50     private boolean find(String s, String t){
    51         return root(s).equals(root(t));
    52     }
    53     
    54     private String root(String s){
    55         if(!s.equals(parent.get(s))){
    56             String p = root(parent.get(s));
    57             parent.put(s, p);
    58         }
    59         
    60         return parent.get(s);
    61     }
    62     
    63     private void union(String s, String t){
    64         String p = root(s);
    65         String q = root(t);
    66         if(size.get(p) > size.get(q)){
    67             size.put(p, size.get(p) + size.get(q));
    68             parent.put(q, p);
    69         }else{
    70             size.put(q, size.get(q) + size.get(p));
    71             parent.put(p, q);
    72         }
    73         
    74         count--;
    75     }
    76 }
  • 相关阅读:
    【原】泛型委托
    【原】web页面登陆验证
    【原】在一般处理程序中设置session
    16Aspx.com-PHP企业整站源码 景观石材大理石类织梦模板 含手机移动端 完整源码 APP+PC
    16Aspx.com-将15位身份证转换成18位
    16Aspx.com-书通网中小学生免费在线学习网站源码 带采集带手机版帝国cms内核
    16Aspx.com源码2014年7月详细
    Web电子商务网(三层)V2.0源码
    毫秒级百万数据分页存储过程
    C#做的一个加密/解密的类
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/12395004.html
Copyright © 2011-2022 走看看