文件: root - text - article - 2019 - 10 - daily-problem-twitter-palindrome.txt
标签: 每日算法, 回文数, 面试, Python, daily problem, palindrome, algorithms, twitter interview question, python, | 英文 | 主页 | 类别: 计算机科学 | 503 次阅读, 18665 次搜索 | 69 个单词
| 浏览 | 博客存档
标签: 每日算法, 回文数, 面试, Python, daily problem, palindrome, algorithms, twitter interview question, python, | 英文 | 主页 | 类别: 计算机科学 | 503 次阅读, 18665 次搜索 | 69 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Twitter:
A palindrome is a sequence of characters that reads the same backwards and forwards. Given a string, s, find the longest palindromic substring in s.
Example:
Input: "banana"
Output: "anana"
Input: "million"
Output: "illi"
标签: 每日算法, 回文数, 面试, Python, daily problem, palindrome, algorithms, twitter interview question, python, | 英文 | 主页 | 类别: 计算机科学 | 503 次阅读, 18665 次搜索 | 69 个单词 A palindrome is a sequence of characters that reads the same backwards and forwards. Given a string, s, find the longest palindromic substring in s.
Example:
Input: "banana"
Output: "anana"
Input: "million"
Output: "illi"
class Solution:
def longestPalindrome(self, s):
# Fill this in.
# Test program
s = "tracecars"
print(str(Solution().longestPalindrome(s)))
# racecar
猜您喜欢...
- [Daily Problem] Longest Increasing Subsequence
- [Daily Problem] Remove k-th Last Element From Linked List
- YES!!
- Algorithm Interview Question: Symmetric k-ary Tree
- Daily Interview Problem: Count Number of Unival Subtrees
- Daily Interview Puzzle: Ways to Traverse a Grid
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
- Fix Brackets
- Algorithm Interview Question: H-Index
- Skip the readings, focus on problems. And use all the hints!
©2006~2024 牛排过熟 - 0.99219 秒 - -55.226 KB/s - 14 在线 内存: 518.59 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。