LeetCode Weekly Contest 129
LeetCode Weekly Contest 129
Read morefib recursion-memoization 装饰器实现
fib recursion-memoization 装饰器实现 原题：LeetCode explore: recursion-memoization
Read more94. Binary Tree Inorder Traversal
94. Binary Tree Inorder Traversal Description Given a binary tree, return the inorder traversal of its nodes’ values.
Read moreLeetCode - 934. Shortest Bridge
934. Shortest Bridge Description In a given 2D binary array A, there are two islands. (An island is a 4-directionally connected group of 1s not connected to any other 1s.)
Read more300. Longest Increasing Subsequence
300. Longest Increasing Subsequence Description Given an unsorted array of integers, find the length of longest increasing subsequence. (For this question, it’s stricly increasing.)
Read more284. Peeking Iterator
LeetCode 284. Peeking Iterator Description Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operation – it essentially peek() at the element that will be returned by the next call to next().
Read more28. Implement strStr()
28. Implement strStr() Description Implement strStr().
Read more215. Kth Largest Element in an Array
215. Kth Largest Element in an Array Description Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
Read more
160. Intersection of Two Linked Lists
160. Intersection of Two Linked Lists Description Write a program to find the node at which the intersection of two singly linked lists begins.
Read more155. Min Stack
155. Min Stack Description Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() – Get the top element. getMin() – Retrieve the minimum element in the stack.
Read more