LeetCode-Groups of Special-Equivalent Strings

最新推荐文章于 2020-02-04 09:53:10 发布

BeHelium

最新推荐文章于 2020-02-04 09:53:10 发布

阅读量190

点赞数

分类专栏： LeetCode 文章标签： LeetCode Java

本文链接：https://blog.csdn.net/qq_24133491/article/details/82831460

版权

LeetCode 专栏收录该内容

306 篇文章 0 订阅

订阅专栏

Description：
You are given an array A of strings.

Two strings S and T are special-equivalent if after any number of moves, S == T.

A move consists of choosing two indices i and j with i % 2 == j % 2, and swapping S[i] with S[j].

Now, a group of special-equivalent strings from A is a non-empty subset S of A such that any string not in S is not special-equivalent with any string in S.

Return the number of groups of special-equivalent strings from A.

Example 1:

Input: ["a","b","c","a","c","c"]
Output: 3
Explanation: 3 groups ["a","a"], ["b"], ["c","c","c"]

Example 2:

Input: ["aa","bb","ab","ba"]
Output: 4
Explanation: 4 groups ["aa"], ["bb"], ["ab"], ["ba"]

Example 3:

Input: ["abc","acb","bac","bca","cab","cba"]
Output: 3
Explanation: 3 groups ["abc","cba"], ["acb","bca"], ["bac","cab"]

Example 4:

Input: ["abcd","cdab","adcb","cbad"]
Output: 1
Explanation: 1 group ["abcd","cdab","adcb","cbad"]

Note:

1 <= A.length <= 1000
1 <= A[i].length <= 20
All A[i] have the same length.
All A[i] consist of only lowercase letters.

题意：给定一个字符串数组，找出一共有多少组的special-equivalent字符串，其定义是字符串S中的字符经过交换S[i]与S[j]（i % 2 == j % 2）后于字符串T相同；

解法：这道题主要的问题就在于怎么判断两个字符串是否为special-equivalent字符串；交换的条件是i % 2 == j % 2，也就是说交换的是字符串中的奇数位或者是偶数位；因此，我们可以将字符串中的奇数位字符和偶数位字符组成两个新的字符串S1和S2，同样的对另外一个字符串做一样的操作得到字符串T1和T2，如果两个字符串为special-equivalent，那么应当满足

Arrays.sort(S1).equals(Arrays.sort(T1))
Arrays.sort(S2).equals(Arrays.sort(T2))

Java

class Solution {
    public int numSpecialEquivGroups(String[] A) {
        boolean[] visited = new boolean[A.length];
        int cnt = 0;
        for (int i = 0; i < A.length; i++) {
            boolean group = false;
            if (visited[i]) continue;
            for (int j = i + 1; j < A.length; j++) {
                if (!visited[j] && specialEquivalent(A[i], A[j])) {
                    group = true;
                    visited[j] = true;
                }
            }
            cnt++;
        }
        return cnt;
    }
    
    private boolean specialEquivalent (String S, String T) {
        char[] S1 = new char[S.length() / 2 + 1];
        char[] S2 = new char[S.length() / 2 + 1];
        char[] T1 = new char[T.length() / 2 + 1];
        char[] T2 = new char[T.length() / 2 + 1];
        for (int i = 0; i < S.length(); i++) {
            if (i % 2 == 0) S1[i / 2] = S.charAt(i);
            else S2[i / 2]= S.charAt(i);
        }
        for (int i = 0; i < T.length(); i++) {
            if (i % 2 == 0) T1[i / 2] = T.charAt(i);
            else T2[i / 2]= T.charAt(i);
        }
        Arrays.sort(S1);
        Arrays.sort(S2);
        Arrays.sort(T1);
        Arrays.sort(T2);
        return Arrays.toString(S1).equals(Arrays.toString(T1)) &&
               Arrays.toString(S2).equals(Arrays.toString(T2)) ? true : false;
    }
}