文件: root - text - article - 2019 - 11 - buddy-strings.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1026 次阅读, 19136 次搜索 | 109 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1026 次阅读, 19136 次搜索 | 109 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by AirBNB:
Given two strings A and B of lowercase letters, return true if and only if we can swap two letters in A so that the result equals B.
Example 1:
Input: A = "ab", B = "ba"
Output: true
Example 2:
Input: A = "ab", B = "ab"
Output: false
Example 3:
Input: A = "aa", B = "aa"
Output: true
Example 4:
Input: A = "aaaaaaabc", B = "aaaaaaacb"
Output: true
Example 5:
Input: A = "", B = "aa"
Output: false
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1026 次阅读, 19136 次搜索 | 109 个单词 Given two strings A and B of lowercase letters, return true if and only if we can swap two letters in A so that the result equals B.
Example 1:
Input: A = "ab", B = "ba"
Output: true
Example 2:
Input: A = "ab", B = "ab"
Output: false
Example 3:
Input: A = "aa", B = "aa"
Output: true
Example 4:
Input: A = "aaaaaaabc", B = "aaaaaaacb"
Output: true
Example 5:
Input: A = "", B = "aa"
Output: false
Here's a starting point:
class Solution:
def buddyStrings(self, A, B):
# Fill this in.
print Solution().buddyStrings('aaaaaaabc', 'aaaaaaacb')
# True
print Solution().buddyStrings('aaaaaabbc', 'aaaaaaacb')
# False
猜您喜欢...
- [Daily Problem] Validate Balanced Parentheses
- Daily Interview Problem: Product of Array Except Self
- Daily Interview Problem: Queue Using Two Stacks
- Daily Interview Problem: Largest Product of 3 Elements I
- Skip the readings, focus on problems. And use all the hints!
- [Daily Problem] Remove Consecutive Nodes that Sum to 0
- A trick for getting good at coding interviews FASTER
- Find Missing Numbers in an Array
- Daily Interview Question: Edit Distance
- Making a Height Balanced Binary Search Tree
©2006~2024 牛排过熟 - 0.0094 秒 - 2179.628 KB/s - 23 在线 内存: 493.5 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。