文件: root - text - article - 2020 - 02 - palindrome-integers.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 354 次阅读, 22941 次搜索 | 57 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 354 次阅读, 22941 次搜索 | 57 个单词
| 浏览 | 博客存档Hi, here's your problem today. This problem was recently asked by Twitter:
Given an integer, check if that integer is a palindrome. For this problem do not convert the integer to a string to check if it is a palindrome.
import math
def is_palindrome(n):
# Fill this in.
print is_palindrome(1234321)
# True
print is_palindrome(1234322)
# False
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 354 次阅读, 22941 次搜索 | 57 个单词 Given an integer, check if that integer is a palindrome. For this problem do not convert the integer to a string to check if it is a palindrome.
import math
def is_palindrome(n):
# Fill this in.
print is_palindrome(1234321)
# True
print is_palindrome(1234322)
# False
猜您喜欢...
- Algorithm Interview Question: Symmetric k-ary Tree
- Daily Interview Problem: Tree Serialization
- Find Missing Numbers in an Array
- Skip the readings, focus on problems. And use all the hints!
- Number of Ways to Climb Stairs
- Daily Interview Problem: Buddy Strings
- Daily Interview Problem:Create a balanced binary search tree
- Find Pythagorean Triplets
- Daily Interview Problem: Distribute Bonuses
- Daily Interview Problem: Count Number of Unival Subtrees
最后更新: October 30 2020 14:21:12 |
©2006~2024 牛排过熟 - 0.01324 秒 - 4014.446 KB/s - 119 在线 
内存: 529.98 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="不索引, 跟踪" />
内存: 529.98 KB18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。