leetcode
zl87758539
C++/PYTHON/ASR
展开
-
[leetcode]Two Sum C++ python实现
方法一:用HASH表,将每个数x依次放入hash表中;然后检查hash表有没有有没有target-x的数,有就输出。python实现:class Solution(object): """docstring for ClassName""" def twoSum(self, nums, target): dict={} for i in xran原创 2015-09-21 10:51:37 · 481 阅读 · 0 评论 -
[leetcode]55. Jump Game ,C++/PYTHON实现,medium难度
[leetcode]55. Jump Game ,C++/PYTHON实现,medium难度原创 2016-06-16 21:50:40 · 1496 阅读 · 0 评论 -
[leetcode]41. First Missing Positive,C++/python实现,hard难度
[leetcode]41. First Missing Positive,C++/python实现,hard难度原创 2016-06-16 19:37:56 · 895 阅读 · 0 评论 -
[leetcode]40. Combination Sum II ,python实现【medium难度】
Combination sum 2.python实现原创 2016-06-16 17:37:04 · 2018 阅读 · 0 评论 -
[leetcode]39. Combination Sum,python实现【Medium难度】
39.COMBINATION SUM,PYTHON实现原创 2016-06-16 17:01:20 · 5357 阅读 · 0 评论 -
【leetcode】 46. Permutations ,python实现
Permutations Given a collection of distinct numbers, return all possible permutations.For example, [1,2,3] have the following permutations: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,原创 2016-06-15 15:43:54 · 5790 阅读 · 0 评论 -
[leetcode]47. Permutations II,python实现
题目: Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2] have the following unique permutations: [ [1,1,2],原创 2016-06-16 16:24:48 · 2086 阅读 · 0 评论 -
[leetcode]53. Maximum Subarray 最大连续子串python实现【medium】
题目: Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the cont原创 2016-06-15 00:30:28 · 5767 阅读 · 1 评论 -
Python if 和 for 的多种写法
a, b, c = 1, 2, 3【对比Cpp里:c = a >b? a:b】这个写法,python只能常规的空行,缩进吗?人生苦短,我用python,下面介绍几种if的方便的方法。1.常规if a>b: c = aelse: c = b2.表达式c = a if a>b else b原创 2016-06-15 00:05:55 · 55181 阅读 · 0 评论 -
[leetcode]20. Valid Parentheses ,有效的括号符串python实现【easy】
题目: Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. The brackets must close in the correct order, “()” and “()[]{}” are all原创 2016-06-14 22:58:30 · 887 阅读 · 0 评论 -
[leetcode] 17. Letter Combinations of a Phone Number ,python实现【medium】
Letter Combinations of a Phone Number Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the teleph原创 2016-06-14 22:25:54 · 2262 阅读 · 0 评论 -
[leetcode] 19. Remove Nth Node From End of List python实现【easy】
Remove Nth Node From End of List My Submissions QuestionEditorial Solution Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1原创 2016-06-14 21:50:21 · 1531 阅读 · 0 评论 -
[leetcode]Generate Parentheses 生成圆括号 python实现
Generate Parentheses原创 2016-06-12 09:36:27 · 2588 阅读 · 0 评论 -
【Leetcode】287. Find the Duplicate Number My Submissions QuestionEditorial Solution python实现
题目:Find the Duplicate Number My Submissions QuestionEditorial SolutionGiven an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate原创 2016-06-03 17:28:20 · 436 阅读 · 0 评论 -
【leetcode】3SUM python实现
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: Elements in a triplet (a,b,c) must be i原创 2016-06-03 13:08:40 · 2462 阅读 · 0 评论 -
【leetcode】Integer to Roman--python实现
题目要求:- 罗马数规则:基本字符 I V X L C D M 相应的阿拉伯数字表示为 1 5 10 50 100 500 1000 相同的数字连写、所表示的数等于这些数字相加得到的数、如:Ⅲ=3; 小的数字在大的数字的右边、所表示的数等于这些数字相加得到的数、 如:Ⅷ=8、Ⅻ=12; 小的数字、(限于 Ⅰ、X 和 C)在大的数字的左边、所表示的数等于大数减小原创 2016-06-02 17:16:51 · 388 阅读 · 0 评论 -
【leetcode】Container with most water--python实现
欢迎使用Markdown编辑器写博客本Markdown编辑器使用[StackEdit][6]修改而来,用它写博客,将会带来全新的体验哦:Markdown和扩展Markdown简洁的语法代码块高亮图片链接和图片上传LaTex数学公式UML序列图和流程图离线写博客导入导出Markdown文件丰富的快捷键快捷键加粗 Ctrl + B 斜体 Ctrl + I 引用原创 2016-06-02 16:18:03 · 333 阅读 · 0 评论 -
[leetcode]45. Jump Game II 跳棋游戏2 C++/PYTHON实现【hard难度】
题目 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your go原创 2016-06-17 10:15:08 · 2069 阅读 · 0 评论