class Solution(object): def fizzBuzz(self, n): a = [] i = 1 while(i <= n): if(i%15 == 0): a.append("FizzBuzz") elifleetcode day_01

【class Solution(object): def fizzBuzz(self, n): a = [] i = 1 while(i <= n): if(i%15 == 0): a.append("FizzBuzz") elifleetcode day_01】的更多相关文章

class Solution(object): def fizzBuzz(self, n): a = [] i = 1 while(i <= n): if(i%15 == 0): a.append("FizzBuzz") elifleetcode day_01

412. Fizz Buzz Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three it should output "Fizz" instead of the number and for the multiples of five output "Buzz". For numbers which are m…

[LeetCode]题解（python）：017-Letter Combinations of a Phone Number

题目来源: https://leetcode.com/problems/letter-combinations-of-a-phone-number/ 题意分析: 这道题是输入一段数字字符digits,在手机上每个数字所对应不同的字符.具体对应如图: 返回所有的数字字符对应的字符的可能.比如输入“123”,那么输出["*ad","*ae","*af","*bd","*be","*bf",&…

【LeetCode】84. Largest Rectangle in Histogram 柱状图中最大的矩形（Python）

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法单调栈日期题目地址: https://leetcode.com/problems/largest-rectangle-in-histogram/description/ 题目描述 Given n non-negative integers representing the histogram's bar height where the widt…

412. Fizz Buzz

https://leetcode.com/problems/fizz-buzz/ 没什么好说的,上一个小学生解法 class Solution(object): def fizzBuzz(self, n): l=[] for x in xrange(1, n+1): if x%15==0: l.append("FizzBuzz") elif x%3==0: l.append("Fizz") elif x%5==0: l.append("Buzz"…

[LeetCode] 412. Fizz Buzz 嘶嘶嗡嗡

Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For numbers which are multiples of both three and fiv…

python leetcode 1

开始刷 leetcode, 简单笔记下自己的答案, 目标十一结束之前搞定所有题目. 提高一个要求, 所有的答案执行效率必须要超过 90% 的 python 答题者. 1. Two Sum. class Solution(object): def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ tmp = []…

Python字符串倒序-7. Reverse Integer

今天做了下LeetCode上面字符串倒序的题目,突然想Python中字符串倒序都有哪些方法,于是网上查了下,居然有这么多种方法: 个人觉得,第二种方法是最容易想到的,因为List中的reverse方法比较常用,做LeetCode题目7. Reverse Integer也用了这种方法,程序耗时65ms #字符串的反转 #用到for循环的步长参数,从大到小循环,到0为止 def reverse1 (s): rt = '' for i in range(len(s)-1, -1, -1): rt +=…