# leetcode 1433. Check If a String Can Break Another String（python）

2022-02-01 02:00:16

「 This is my participation 11 The fourth of the yuegengwen challenge 21 God , Check out the activity details ：2021 One last more challenge

### describe

Given two strings: s1 and s2 with the same size, check if some permutation of string s1 can break some permutation of string s2 or vice-versa. In other words s2 can break s1 or vice-versa.

A string x can break string y (both of size n) if x[i] >= y[i] (in alphabetical order) for all i between 0 and n-1.

Example 1:

``````Input: s1 = "abc", s2 = "xya"
Output: true
Explanation: "ayx" is a permutation of s2="xya" which can break to string "abc" which is a permutation of s1="abc".
Copy code ``````

Example 2:

``````Input: s1 = "abe", s2 = "acd"
Output: false
Explanation: All permutations for s1="abe" are: "abe", "aeb", "bae", "bea", "eab" and "eba" and all permutation for s2="acd" are: "acd", "adc", "cad", "cda", "dac" and "dca". However, there is not any permutation from s1 which can break some permutation from s2 and vice-versa.
Copy code ``````

Example 3:

``````Input: s1 = "leetcodee", s2 = "interview"
Output: true
Copy code ``````

Note:

``````s1.length == n
s2.length == n
1 <= n <= 10^5
All strings consist of lowercase English letters.
Copy code ``````

### analysis

According to the meaning , Given two strings of the same length s1 and s2, Check string s1 Whether some permutations of can break the string s2 Some permutations of , vice versa . In short, it is ,s2 Can destroy s1, vice versa . If for 0 and n-1 Between all i ,x[i] >= y[i]（ In alphabetical order ）, Represents a string x You can break the string y（ The length is n ）.

In fact, after reading the title, we will know that it is actually judgment s1 Than s2 The characters in the corresponding position are large or small , This situation must be right s1 and s2 Sort in ascending order , Then compare whether you are satisfied s1 Than s2 The characters in the corresponding position are large or small .

``````class Solution(object):
def checkIfCanBreak(self, s1, s2):
"""
:type s1: str
:type s2: str
:rtype: bool
"""
s1 = list(s1)
s2 = list(s2)
s1.sort()
s2.sort()
def check(s1, s2):
for i in range(len(s1)):
if s1[i] < s2[i]:
return False
return True
return check(s1, s2) or check(s2, s1)

Copy code ``````

### Running results

``````Runtime: 172 ms, faster than 86.67% of Python online submissions for Check If a String Can Break Another String.
Memory Usage: 19.9 MB, less than 53.33% of Python online submissions for Check If a String Can Break Another String.
Copy code ``````

### analysis

Similar to the principle above , It's just judgment s1 Than s2 Whether the number of characters with large or small corresponding positions is equal to s1 The length of .

``````class Solution(object):
def checkIfCanBreak(self, s1, s2):
"""
:type s1: str
:type s2: str
:rtype: bool
"""
s1 = sorted(s1)
s2 = sorted(s2)
a = b = 0
n = len(s1)
for i in range(len(s1)):
if s1[i] <= s2[i]:
a += 1
if s1[i] >= s2[i]:
b += 1
return a == n or b == n

Copy code ``````

### Running results

``````Runtime: 228 ms, faster than 53.33% of Python online submissions for Check If a String Can Break Another String.
Memory Usage: 20.2 MB, less than 26.67% of Python online submissions for Check If a String Can Break Another String.
Copy code ``````