MRxjh的博客

c++:class Solution {public: bool isPalindrome(int x) { if(x<0) return false; std::string str = std::to_string(x); for(std::string::iterator i = str.begin(), j = str.end...

python:class Solution: def firstUniqChar(self, s): """ :type s: str :rtype: int """ l = dict() for i in list(s): if i in l: ...

python:class Solution(object): def merge(self, nums1, m, nums2, n): """ :type nums1: List[int] :type m: int :type nums2: List[int] :type n: int :...

python:class Solution: def uniqueMorseRepresentations(self, words): """ :type words: List[str] :rtype: int """ m = [".-","-...","-.-.","-..&quot

python:class Solution: def mySqrt(self, x): """ :type x: int :rtype: int """ left = 0 right = x while (left <= right): mid...

python:class Solution: def buddyStrings(self, A, B): """ :type A: str :type B: str :rtype: bool """ if A == B: return len(set(A)) !=...

python:class Solution: def generate(self, numRows): """ :type numRows: int :rtype: List[List[int]] """ res = [] arr = [1]*numRows ...

python:class Solution: def findErrorNums(self, nums): """ :type nums: List[int] :rtype: List[int] """ l = len(nums) res = [] res.append(s...

python:class Solution: def isHappy(self, n): """ :type n: int :rtype: bool """ check = [n] while (n != 1): t = 0 for j in...

python:class Solution: def leafSimilar(self, root1, root2): """ :type root1: TreeNode :type root2: TreeNode :rtype: bool """ def leaf(root): ...

python:class Solution: def dailyTemperatures(self, temperatures): """ :type temperatures: List[int] :rtype: List[int] """ stack = [[temperatures[0], 0]]...

python:class Solution(object): def binaryTreePaths(self, root): """ :type root: TreeNode :rtype: List[str] """ path = '' res = [] self.Tr...

python:class Solution: def floodFill(self, image, sr, sc, newColor): """ :type image: List[List[int]] :type sr: int :type sc: int :type newColor: int ...

python：class MinStack: def __init__(self): """ initialize your data structure here. """ self.stack = [] def push(self, x): """ :ty...

python；class Solution: def mostCommonWord(self, paragraph, banned): """ :type paragraph: str :type banned: List[str] :rtype: str """ res = ('', -...

python:class Solution(object): def hasCycle(self, head): """ :type head: ListNode :rtype: bool """ if not head: return False ...

python:class Solution: def searchMatrix(self, matrix, target): """ :type matrix: List[List[int]] :type target: int :rtype: bool """ if len(matrix) =...

python:class Solution: def diameterOfBinaryTree(self, root): """ :type root: TreeNode :rtype: int """ if not root: return 0 self.long...

python:class Solution: def convertToTitle(self, n): """ :type n: int :rtype: str """ ans = '' while n > 0: n = n - 1 j = ...

python:class Solution: def isUgly(self, num): """ :type num: int :rtype: bool """ if num == 1 : return True if num == 0: ret...

python:class Solution: def minCostClimbingStairs(self, cost): """ :type cost: List[int] :rtype: int """ for i in range(2,len(cost)): cost[i] += ...

python:class Solution: def isIsomorphic(self, s, t): """ :type s: str :type t: str :rtype: bool """ dic = dict() for i,j in zip(s,t): ...

python:class Solution(object): def wordPattern(self, pattern, str): """ :type pattern: str :type str: str :rtype: bool """ stlist = str.split() ...

python:class MyQueue: def __init__(self): """ Initialize your data structure here. """ self.s1 = [] self.s2 = [] def push(self, x): """ ...

python:class Solution: def moveZeroes(self, nums): """ :type nums: List[int] :rtype: void Do not return anything, modify nums in-place instead. """ i = 0 ...

python：class Solution: def restoreIpAddresses(self, s): """ :type s: str :rtype: List[str] """ def dfs(s, index, path, res): if index == 4: ...

C++:class Solution {public: int threeSumClosest(vector<int>& nums, int target) { sort(nums.begin(), nums.end()); int l, r; int res = INT_MAX; int ans = 0...

c++:class Solution {public: void rotate(vector<int>& nums, int k) { k = k % nums.size(); reverse(nums.begin(), nums.end()); reverse(nums.begin(), nums.begin() + ...

c++:class Solution {public: void rotate(vector<int>& nums, int k) { k = k % nums.size(); reverse(nums.begin(), nums.end()); reverse(nums.begin(), nums.begin() + ...

python:class Solution: def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ res = 0 l = 0 for i in nums: ...

python:class Solution: def lemonadeChange(self, bills): """ :type bills: List[int] :rtype: bool """ mon = dict() mon[5] = 0 mon[10] = 0 ...

python:class Solution: def searchInsert(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ t = 0 for index, i ...

python:class Solution: def plusOne(self, digits): """ :type digits: List[int] :rtype: List[int] """ res = [] t = 1 for i in digits[::-1]: ...

python:class Solution: def averageOfLevels(self, root): """ :type root: TreeNode :rtype: List[float] """ if root is None: return [] r...