PythonOJ
WhiteJunior
这个作者很懒,什么都没留下…
展开
-
LC-Image Smoother
import copyclass Solution(object): def imageSmoother(self, M): """ :type M: List[List[int]] :rtype: List[List[int]] """ len_x = len(M) len_y = len...原创 2018-03-03 18:44:36 · 201 阅读 · 0 评论 -
LC-Best Time to Buy and Sell Stock II
class Solution(object): def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ res = 0 for i in range(len(prices)-1):原创 2018-02-06 23:40:23 · 178 阅读 · 0 评论 -
LC-1-bit and 2-bit Characters
class Solution(object): def isOneBitCharacter(self, bits): """ :type bits: List[int] :rtype: bool """ i = 0 while (i 1): if bits[i] == 0原创 2018-01-30 14:39:36 · 167 阅读 · 0 评论 -
LC-Same Tree
方法1:# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object...原创 2018-02-10 23:56:22 · 177 阅读 · 0 评论 -
LC-Construct String from Binary Tree
# Definition for a binary tree node.class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solution(object): def tree原创 2018-01-29 17:43:17 · 144 阅读 · 0 评论 -
LC-Intersection of Two Arrays
class Solution(object): def intersection(self, nums1, nums2): """ :type nums1: List[int] :type nums2: List[int] :rtype: List[int] """ res = []原创 2018-02-05 16:41:46 · 144 阅读 · 0 评论 -
LC-Add Digits
方法1:class Solution(object): def addDigits(self, num): """ :type num: int :rtype: int """ count = 0 s = str(num) for i in range(len(s)):原创 2018-01-20 22:06:01 · 192 阅读 · 0 评论 -
LC-Roman to Integer
class Solution(object): def romanToInt(self, s): """ :type s: str :rtype: int """ roman_dict = {'M':1000, 'D':500, 'C':100, 'L':50, 'X':10, 'V':5, 'I':1} ...原创 2018-02-09 23:10:07 · 161 阅读 · 0 评论 -
LC-Jewels and Stones
class Solution(object): def numJewelsInStones(self, J, S): """ :type J: str :type S: str :rtype: int """ count = 0 for i in range(len(J)):原创 2018-01-29 00:45:47 · 178 阅读 · 0 评论 -
LC-Two Sum IV - Input is a BST
方法1:# Definition for a binary tree node.class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solution(object):原创 2018-01-29 00:06:11 · 233 阅读 · 0 评论 -
LC-Minimum Moves to Equal Array Elements
class Solution(object): def minMoves(self, nums): """ :type nums: List[int] :rtype: int """ minNUm = min(nums) n = len(nums) Sum = sum(nums)原创 2018-02-04 23:34:03 · 147 阅读 · 0 评论 -
LC-Ransom Note
class Solution(object): def canConstruct(self, ransomNote, magazine): """ :type ransomNote: str :type magazine: str :rtype: bool """ for i in range(...原创 2018-02-08 21:36:12 · 181 阅读 · 0 评论 -
LC-Flood Fill
class Solution(object): def floodFill(self, image, sr, sc, newColor): """ :type image: List[List[int]] :type sr: int :type sc: int :type newColor: int原创 2018-02-03 23:47:53 · 176 阅读 · 0 评论 -
LC-Detect Capital
class Solution(object): def detectCapitalUse(self, word): """ :type word: str :rtype: bool """ if word.isupper(): return True elif word.原创 2018-01-19 11:17:26 · 185 阅读 · 0 评论 -
LC-Excel Sheet Column Number
class Solution(object): def titleToNumber(self, s): """ :type s: str :rtype: int """ count = 0 for i in range(len(s)-1): count += (ord(原创 2018-02-02 23:27:10 · 183 阅读 · 0 评论 -
LC-Construct the Rectangle
class Solution(object): def constructRectangle(self, area): """ :type area: int :rtype: List[int] """ start = int(area ** 0.5) while area % start !原创 2018-02-02 22:38:30 · 233 阅读 · 0 评论 -
LC-Degree of an Array
#coding:utf-8import collectionsclass Solution(object): def findShortestSubArray(self, nums): """ :type nums: List[int] :rtype: int """ c_dic = collections...原创 2018-02-26 20:10:35 · 182 阅读 · 0 评论 -
LC-Sum of Left Leaves
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): d...原创 2018-02-12 23:39:03 · 173 阅读 · 0 评论 -
LC-Number of Boomerangs
class Solution(object): def numberOfBoomerangs(self, points): """ :type points: List[List[int]] :rtype: int """ res = 0 for p in points: ...原创 2018-03-02 11:19:07 · 150 阅读 · 0 评论 -
LC-Minimum Index Sum of Two Lists
方法1:class Solution(object): def findRestaurant(self, list1, list2): """ :type list1: List[str] :type list2: List[str] :rtype: List[str] """ common...原创 2018-03-01 16:56:22 · 217 阅读 · 0 评论 -
LC-Minimum Distance Between BST Nodes
# Definition for a binary tree node.class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solution(object): def min...原创 2018-02-22 15:24:47 · 189 阅读 · 0 评论 -
LC-Contains Duplicate
方法1:class Solution(object): def containsDuplicate(self, nums): """ :type nums: List[int] :rtype: bool """ if not nums: return False ...原创 2018-02-21 16:05:26 · 195 阅读 · 0 评论 -
LC-Relative Ranks
方法1:class Solution(object): def findRelativeRanks(self, nums): """ :type nums: List[int] :rtype: List[str] """ length = len(nums) s_sorted = sor...原创 2018-02-20 17:16:21 · 254 阅读 · 0 评论 -
LC-Reverse Linked List
方法1:(迭代)# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def reverseList(sel...原创 2018-02-28 16:55:03 · 149 阅读 · 0 评论 -
LC-Minimum Absolute Difference in BST
# Definition for a binary tree node.class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solution(object): def get...原创 2018-02-19 21:23:34 · 184 阅读 · 0 评论 -
LC-Delete Node in a Linked List
# Definition for singly-linked list.class ListNode(object): def __init__(self, x): self.val = x self.next = Noneclass Solution(object): def deleteNode(self, node): ...原创 2018-02-18 17:49:47 · 150 阅读 · 0 评论 -
LC-Two Sum II - Input array is sorted
class Solution(object): def twoSum(self, numbers, target): """ :type numbers: List[int] :type target: int :rtype: List[int] """ start = 0 en...原创 2018-02-17 16:17:27 · 176 阅读 · 0 评论 -
LC-First Unique Character in a String
class Solution(object): def firstUniqChar(self, s): """ :type s: str :rtype: int """ alphabet = 'abcdefghijklmnopqrstuvwxyz' index = [s.index(l) for...原创 2018-02-16 23:12:55 · 152 阅读 · 0 评论 -
LC-Valid Anagram
import collectionsclass Solution(object): def isAnagram(self, s, t): """ :type s: str :type t: str :rtype: bool """ return collections.Counter(s) =...原创 2018-02-15 00:28:44 · 174 阅读 · 0 评论 -
LC-Rotated Digits
class Solution(object): def rotatedDigits(self, N): """ :type N: int :rtype: int """ res = 0 def isValid(num): flag = False ...原创 2018-02-27 19:22:57 · 229 阅读 · 0 评论 -
LC-Assign Cookies
class Solution(object): def findContentChildren(self, g, s): """ :type g: List[int] :type s: List[int] :rtype: int """ g1 = sorted(g) s1 = s...原创 2018-02-14 21:57:14 · 174 阅读 · 0 评论 -
LC-Binary Tree Tilt
#code: utf-8# Definition for a binary tree node.class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solution(object)...原创 2018-02-14 20:19:54 · 156 阅读 · 0 评论 -
LC-Majority Element
class Solution(object): def majorityElement(self, nums): """ :type nums: List[int] :rtype: int """ dic = {} for i in nums: if i in dic:原创 2018-02-07 21:18:01 · 160 阅读 · 0 评论 -
LC-Range Addition II
方法1:class Solution(object): def maxCount(self, m, n, ops): """ :type m: int :type n: int :type ops: List[List[int]] :rtype: int """ if n原创 2018-02-02 19:13:47 · 160 阅读 · 0 评论 -
LC-Toeplitz Matrix
class Solution(object): def isToeplitzMatrix(self, matrix): """ :type matrix: List[List[int]] :rtype: bool """ len_x = len(matrix) len_y = len(matri原创 2018-01-26 17:50:48 · 250 阅读 · 0 评论 -
LC-Convert BST to Greater Tree
#Definition for a binary tree node.class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solution(object): def conve原创 2018-02-02 16:21:03 · 142 阅读 · 0 评论 -
LC-Longest Uncommon Subsequence I
class Solution(object): def findLUSlength(self, a, b): """ :type a: str :type b: str :rtype: int """ if a == b: return -1 return原创 2017-12-25 16:05:46 · 179 阅读 · 0 评论 -
LC-HammingDistance
class Solution(object): def hammingDistance(self, x, y): return bin(x^y).count('1')Sol = Solution()dis = Sol.hammingDistance(1,4)print dis0,这是个效率非常高的算法 1,x^y为异或运算(相同取0,不同取1) 2,bin(int)为十进制向原创 2017-12-06 16:07:17 · 183 阅读 · 0 评论 -
LC-Next Greater Element I
class Solution(object): def nextGreaterElement(self, findNums, nums): """ :type findNums: List[int] :type nums: List[int] :rtype: List[int] """ s = [原创 2017-12-23 15:06:11 · 250 阅读 · 0 评论 -
LC-Distribute Candies
class Solution(object): def distributeCandies(self, candies): """ :type candies: List[int] :rtype: int """ return min(len(candies)/2, len(set(candies)))0,非常高原创 2017-12-14 14:44:51 · 157 阅读 · 0 评论