阿虾

摘要： class Solution: def isPalindrome(self, x): if str(x).startswith('-'): return False else: a = str(x) b = a[::-1] if a == b: return True else: return Fa 阅读全文

摘要： http://plugincompat.herokuapp.com/ 阅读全文

摘要： 参考链接： https://www.centos.bz/2018/10/jenkins%E4%BD%BF%E7%94%A8%E5%BC%80%E5%A7%8B%E8%B8%A9%E5%9D%91%EF%BC%881%EF%BC%89/ 阅读全文

摘要： 题目描述： # In this kata, you will write a function that returns the positions and the values of the "peaks" (or local maxima) of a numeric array.## For e 阅读全文

摘要： 题目描述： The maximum sum subarray problem consists in finding the maximum sum of a contiguous subsequence in an array or list of integers: maxSequence([- 阅读全文

摘要： 题目描述： Write a function called that takes a string of parentheses, and determines if the order of the parentheses is valid. The function should return 阅读全文

摘要： 题目描述： # You are given an array strarr of strings and an integer k. Your task is to return the first longest string consisting of k consecutive strings 阅读全文

摘要： 题目描述： # In this kata, you must create a digital root function.## A digital root is the recursive sum of all the digits in a number. Given n, take the 阅读全文

摘要： 我的解答： import mathdef is_prime(n): if n > 1: if n == 2: return True if n % 2 == 0: return False for current in range(3, int(math.sqrt(n) + 1), 2): if n 阅读全文

摘要： 题目描述： # Write a function that takes in a string of one or more words, and returns the same string, but with all five or more letter words reversed (Ju 阅读全文