cainiaohudi的博客

这道题的意思是用堆栈来实现队列，pop和peak是去除和获取最前面的元素。下面就是我用python通过的代码class MyQueue(object): def __init__(self): """ Initialize your data structure here. """ self.stack = [] ...

class Solution(object): def selfDividingNumbers(self, left, right): """ :type left: int :type right: int :rtype: List[int] """ output = [] f...

class Solution(object): def numUniqueEmails(self, email): """ :type emails: List[str] :rtype: int """ result = [] for i in range(len(email)): ...

A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element.Now given an M x N matrix, return True if and only if the matrix is Toeplitz.Example 1:Input: matrix = ...

def topKFrequent(self, nums, k): """ :type nums: List[int] :type k: int :rtype: List[int] """ dict = {} result = [] for i in range(len(n...

我真的没想到我这样写能过，本以为会超过他要求的时间复杂度class Solution: def findMedianSortedArrays(self, nums1, nums2): """ :type nums1: List[int] :type nums2: List[int] :rtype: float ...

借鉴了别人的代码，写成javapackage leetcode;import java.util.Arrays;import java.util.Comparator;class Interval { int start; int end; Interval() { start = 0; end = 0; } Interval(int s, int e...

本题用到Python基本数据类型set，set是一个无序且不重复的元素集合。class Solution(object): def uniqueMorseRepresentations(self, words): """ :type words: List[str] :rtype: int """ Mors...

In a given integer array nums, there is always exactly one largest element.Find whether the largest element in the array is at least twice as much as every other number in the array.If it is, return...