LeetCode 893 Groups of Special-Equivalent Strings 解题报告

2024-05-10 09:30:15

题目要求

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.

题目分析及思路

给定一组字符串，若经过若干次move两个字符串相等，则这两个字符串是special-equivalent。定义一次move是将字符串中的奇数或偶数位置的两个字母交换。题目要求返回这一组字符串的special-equivalent字符串的组数。可以分别对每一个字符串的奇数和偶数位置的字母进行排序再合并，最后将合并的结果放入集合中，集合的长度即为所求。

python代码

class Solution:

def numSpecialEquivGroups(self, A: 'List[str]') -> 'int':

s = set()

for a in A:

s.add(''.join(sorted(a[0::2]))+''.join(sorted(a[1::2])))

return len(s)

转载于:https://www.cnblogs.com/yao1996/p/10401205.html

LeetCode 893 Groups of Special-Equivalent Strings 解题报告相关推荐

【LeetCode】222. Count Complete Tree Nodes 解题报告（Python）
[LeetCode]222. Count Complete Tree Nodes 解题报告(Python) 标签(空格分隔): LeetCode 作者: 负雪明烛 id: fuxuemingzhu 个 ...
[LeetCode]849. Maximize Distance to Closest Person 解题报告(C++)
[LeetCode]849. Maximize Distance to Closest Person 解题报告(C++) 题目描述 In a row of seats, 1 represents a ...
[leetcode] 893. Groups of Special-Equivalent Strings
题目: You are given an array A of strings. Two strings S and T are special-equivalent if after any num ...
[LeetCode] Multiply Strings 解题报告
Given two numbers represented as strings, return multiplication of the numbers as a string. Note: Th ...
【LeetCode】954. Array of Doubled Pairs 解题报告（Python）
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法日期题目地址:https://leetcode.c ...
【LeetCode】328. Odd Even Linked List 解题报告（Python C++）
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法日期题目地址:https://leetcode.c ...
【LeetCode】825. Friends Of Appropriate Ages 解题报告（Python）
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址:https://leetcode.com/problems/friends-o ...
【LeetCode】528. Random Pick with Weight 解题报告（Python）
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址:https://leetcode.com/problems/random-pi ...
Leetcode 389. Find the Difference 找不同解题报告
1 解题思想有两个字符串S和T,T是S打乱后多加一个字符,要找出这个不同的字符来. 嗯,这个问题其实就是异或,除了T多的那个字符外,都可以在异或中消除,不多说,很简单 2 原题 Given two ...
[Leetcode] 33. Search in Rotated Sorted Array 解题报告
题目: Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 ...

最新文章

热门文章