文件: root - text - article - 2020 - 01 - shifted-string.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 857 次阅读, 24407 次搜索 | 79 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 857 次阅读, 24407 次搜索 | 79 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Apple:
You are given two strings, A and B. Return whether A can be shifted some number of times to get B.
Eg. A = abcde, B = cdeab should return true because A can be shifted 3 times to the right to get B. A = abc and B= acb should return false.
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 857 次阅读, 24407 次搜索 | 79 个单词 You are given two strings, A and B. Return whether A can be shifted some number of times to get B.
Eg. A = abcde, B = cdeab should return true because A can be shifted 3 times to the right to get B. A = abc and B= acb should return false.
def is_shifted(a, b):
# Fill this in.
print is_shifted('abcde', 'cdeab')
# True
猜您喜欢...
- Spreadsheet Columns
- Daily Interview Problem: Min Range Needed to Sort
- Find Pythagorean Triplets
- Daily Interview Question: Create a Simple Calculator
- YES!!
- PHP Unit Tests on VPS Server
- Delphi Dynamic Array
- CVE-2015-8874 - cPanel EasyApache Vulnerabilities
- Daily Interview Problem: Arithmetic Binary Tree
- [Daily Problem] Longest Increasing Subsequence
©2006~2024 牛排过熟 - 0.01087 秒 - 1689.707 KB/s - 32 在线 内存: 491.14 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。