leetcode
独鹿
啊哈
展开
-
letcode153Find Minimum in Rotated Sorted Array
class Solution(object): def findMin(self, nums): """ :type nums: List[int] :rtype: int """ l,r=0,len(nums)-1 while l mid=l+(r-l)原创 2017-05-11 12:41:19 · 202 阅读 · 0 评论 -
leetcode154Find Minimum in Rotated Sorted Array II
class Solution(object): def findMin(self, nums): """ :type nums: List[int] :rtype: int """ l,r=0,len(nums)-1 while l=nums[r]: mi原创 2017-05-11 12:53:46 · 216 阅读 · 0 评论 -
leetcode167Two Sum II - Input array is sorted
这个算法易于理解但是效果不是很好class Solution(object): def twoSum(self, numbers, target): """ :type numbers: List[int] :type target: int :rtype: List[int] """原创 2017-05-11 14:23:35 · 215 阅读 · 0 评论 -
leetcode-pow(x,n)
1.python自带方法实现:pow(x,n)2.python自带的幂运算底层实现:x**n在python中*n表示连续拼接几次,在这里就直接表示连续乘n次3.减少循环次数:用递归方式,要考虑几点:(1)n=0的时候;(2)n为偶数的时候,循环次数减少一半;(3)n为奇数的时候,循环次数为(n-1)的一半加1次class Solution(object): def myP原创 2017-04-18 16:59:31 · 258 阅读 · 0 评论 -
leetcode--Letter Combinations of a Phone Number
class Solution(object): def letterCombinations(self, digits): """ :type digits: str :rtype: List[str] """ if ''==digits: return []转载 2017-04-11 19:09:41 · 402 阅读 · 0 评论 -
leecode 之 longestcommonprefix
class Solution(object): def longestCommonPrefix(self, strs): """ :type strs: List[str] :rtype: str """ if not strs: return '' #没有传入直接返回 minSt原创 2017-03-16 18:15:57 · 329 阅读 · 0 评论 -
leecode之3Sum
class Solution(object): def threeSum(self, nums): res = [] nums.sort()#排序有利于去重 for i in xrange(len(nums)-2):#这里的i是2个数之一,所以可取值有len(nums)-2个 if i > 0 and num原创 2017-03-16 17:07:03 · 362 阅读 · 0 评论 -
leecode第三题求最大字符串的长度
思路:遍历字符串,直到遇见重复的字符,然后从重复的字符的后一位重新遍历,一直到再遇见重复的字符时比较3个字符之间的间隔长度class Solution(object): def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int原创 2017-03-05 21:57:46 · 356 阅读 · 0 评论 -
leecoda第二题
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def addTwoNumbers(se原创 2017-03-02 22:23:59 · 320 阅读 · 0 评论 -
IntegerToEnglishWord
public class Solution { public String numberToWords(int num) { if(num==0){ return "Zero"; } int BillionString=num/1000000000; int MillionString=num%1000000000/1000000; int转载 2016-07-06 14:51:57 · 279 阅读 · 0 评论 -
lettcode 37 Sudoku Solver
public class Solution { public void solveSudoku(char[][] board) { if(board == null || board.length == 0) return; solve(board); } public boolean solv原创 2017-05-03 16:58:35 · 243 阅读 · 0 评论 -
leetcode 36 Valid Sudoku
public class Solution { public boolean isValidSudoku(char[][] board) { for(int i = 0; i HashSet rows = new HashSet(); HashSet columns = new HashSet(); HashSet原创 2017-05-03 17:02:26 · 196 阅读 · 0 评论 -
leetcode 42Trapping Rain Water
动态规划public int trap(int[] A) { int a=0; int b=A.length-1; int max=0; int leftmax=0; int rightmax=0; while(a leftmax=Math.max(leftmax,A[a]); rightmax=M原创 2017-05-03 17:25:33 · 255 阅读 · 0 评论 -
leetcode60Permutation Sequence
s原创 2017-05-04 13:30:33 · 206 阅读 · 0 评论 -
lettcode 70 Climbing Stairs
class Solution(object): def climbStairs(self, n): """ :type n: int :rtype: int """ #dp[n]=dp[n-1]+dp[n-2] #1-1,2-2,3-3,4-5,5-8 #a原创 2017-05-04 10:45:42 · 268 阅读 · 0 评论 -
leetcode69. Sqrt(x)
一。二叉树:1.确定左右界2.算mid3.根据条件调整左右键4.重复2-35根据条件返回midpublic int sqrt(int x) { if (x == 0) return 0; int left = 1, right = Integer.MAX_VALUE; while (true) { int mi原创 2017-05-04 11:21:25 · 163 阅读 · 0 评论 -
leetcode68. Text Justification
参考https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/TextJustification.javahttps://www.youtube.com/watch?v=RORuwHiblPc原创 2017-05-04 11:44:43 · 378 阅读 · 0 评论 -
leetcode67Add Binary
class Solution(object): def addBinary(self, a, b): """ :type a: str :type b: str :rtype: str """ m=len(a) n=len(b) maxlen=m原创 2017-05-04 12:06:12 · 178 阅读 · 0 评论 -
leetcode 66plus one
class Solution(object): def plusOne(self, digits): """ :type digits: List[int] :rtype: List[int] """ i=len(digits)-1 while i>=0:原创 2017-05-04 13:24:20 · 211 阅读 · 0 评论 -
leetcode63Unique Paths II
a原创 2017-05-04 13:28:20 · 180 阅读 · 0 评论 -
leetcode 61Rotate List
a原创 2017-05-04 13:30:00 · 232 阅读 · 0 评论 -
Construct Binary Tree from Preorder and Inorder Traversal
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(objec原创 2017-05-24 11:13:25 · 224 阅读 · 0 评论 -
118. Pascal's Triangle
class Solution(object): def generate(self, numRows): """ :type numRows: int :rtype: List[List[int]] """ res=[] if numRows==0: re原创 2017-05-24 15:04:28 · 221 阅读 · 0 评论 -
119. Pascal's Triangle II
class Solution(object): def getRow(self, rowIndex): """ :type rowIndex: int :rtype: List[int] """ pre=[1,1] if rowIndex==0: retu原创 2017-05-24 15:22:41 · 177 阅读 · 0 评论 -
leetcode78subset
class Solution(object): def subsets(self, nums): """ :type nums: List[int] :rtype: List[List[int]] """ nums.sort() res=[] line=[]原创 2017-05-05 12:48:43 · 273 阅读 · 0 评论 -
leetcode90subsetii
class Solution(object): def subsetsWithDup(self, nums): """ :type nums: List[int] :rtype: List[List[int]] """ nums.sort() res=[] lin原创 2017-05-05 12:51:47 · 274 阅读 · 0 评论 -
leetcode 89 GRADCODE
class Solution(object): def grayCode(self, n): """ :type n: int :rtype: List[int] """ res=[0] for i in range(n): res+=[x+pow(2,i原创 2017-05-05 13:22:09 · 289 阅读 · 0 评论 -
leetcode88 merge sorted array
class Solution(object): def merge(self, nums1, m, nums2, n): """ :type nums1: List[int] :type m: int :type nums2: List[int] :type n: int :rty原创 2017-05-05 14:41:53 · 188 阅读 · 0 评论 -
leetcode 87scamblestring
class Solution(object): def isScramble(self, s1, s2): """ :type s1: str :type s2: str :rtype: bool """ n, m = len(s1), len(s2) if n原创 2017-05-05 15:09:35 · 206 阅读 · 0 评论 -
leetcode86 partitionList
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def partition(self,原创 2017-05-05 15:40:39 · 179 阅读 · 0 评论 -
121Best Time to Buy and Sell Stock
class Solution(object): def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ if not prices or len(prices)==0: return原创 2017-05-25 10:43:40 · 192 阅读 · 0 评论 -
leetcode85 85. Maximal Rectangle
class Solution(object): def maximalRectangle(self, matrix): """ :type matrix: List[List[str]] :rtype: int """ if not matrix or not matrix[0]:原创 2017-05-05 20:14:21 · 340 阅读 · 0 评论 -
LEETCODE84Largest Rectangle in Histogram
class Solution(object): def largestRectangleArea(self, height): """ :type heights: List[int] :rtype: int """ height.append(0) stack = [-1]原创 2017-05-05 20:22:46 · 196 阅读 · 0 评论 -
leetcode83Remove Duplicates from Sorted List
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def deleteDuplicates原创 2017-05-05 20:33:55 · 228 阅读 · 0 评论 -
leetcode82Remove Duplicates from Sorted List II
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def deleteDuplicates原创 2017-05-05 20:57:41 · 250 阅读 · 0 评论 -
leetcode81Search in Rotated Sorted Array II
class Solution(object): def search(self, nums, target): """ :type nums: List[int] :type target: int :rtype: bool """ if not nums:原创 2017-05-05 21:17:22 · 290 阅读 · 0 评论 -
Leetcode 80]Remove Duplicates from Sorted Array II
class Solution(object): def removeDuplicates(self, nums): """ :type nums: List[int] :rtype: int """ n=len(nums) if n return n原创 2017-05-05 21:31:25 · 236 阅读 · 0 评论 -
LEETCODE77Combinations
class Solution(object): def combine(self, n, k): """ :type n: int :type k: int :rtype: List[List[int]] candidates=[x for x in range(1,n+1)] i原创 2017-05-05 22:54:23 · 183 阅读 · 0 评论 -
leetcode74Search a 2D Matrix
class Solution(object): def searchMatrix(self, matrix, target): """ :type matrix: List[List[int]] :type target: int :rtype: bool """ if not m原创 2017-05-05 23:17:50 · 273 阅读 · 0 评论 -
LEETCODE73Set Matrix Zeroes
class Solution(object): def setZeroes(self, matrix): """ :type matrix: List[List[int]] :rtype: void Do not return anything, modify matrix in-place instead. """原创 2017-05-05 23:26:46 · 280 阅读 · 0 评论