松鼠豪的坚果

Python实现： class Solution(object): def reverse(self, x): """ :type x: int :rtype: int """ i = 0 str1=str(x) stack = [] fu = False ...

 回文数Python实现 class Solution(object): def isPalindrome(self, x): """ :type x: int :rtype: bool """ temp = str(x)[::-1] if(temp == str(x)): ...

1. 获取两个list 的交集 1 2 3 4 5 6 7 8 9 #方法一: a=[2,3,4,5] b=[2,5,8] tmp = [val for val in a if val in b] print tmp #[2, 5]    ...