String Permutation

最新推荐文章于 2019-12-30 06:02:47 发布

原创最新推荐文章于 2019-12-30 06:02:47 发布 · 277 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#path #string

leetcode 专栏收录该内容

414 篇文章

订阅专栏

本文提供了一种判断两个字符串是否为彼此的排列的方法。通过对比两个字符串的字符频次来确定它们是否相同长度且包含相同的字符。这种方法适用于面试和技术评估场景。

Given two strings, write a method to decide if one is a permutation of the other.

Have you met this question in a real interview?

Yes

python

class Solution:
    """
    @param: A: a string
    @param: B: a string
    @return: a boolean
    """
    def Permutation(self, A, B):
        # write your code here
        if A is None and B is not None:
            return False
        if A is not None and B is None:
            return False
        if A is None and B is None:
            return True
        if len(A) != len(B):
            return False
        arr = [0] * 256
        for ele in list(A):
            arr[ord(ele)] += 1
        for val in list(B):
            arr[ord(val)] -= 1
            if arr[ord(val)] < 0:
                return False
        return True