倪春恩的博客
lc-208 lc-208
/** A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in
2022-09-18
lc-207 lc-207
/** * There are a total of numCourses courses you have to take, labeled from 0 to * numCourses - 1. You are given an a
2022-09-16
lc-206 lc-206
/** Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input:
2022-09-15
lc-200 lc-200
/** Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0 's (water), return the number of isl
2022-09-14
lc-198 lc-198
/** You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stash
2022-09-13
lc-169 lc-169
/** Given an array nums of size n, return the majority element. The majority element is the element that appears more
2022-09-09
lc-160 lc-160
/** Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If th
2022-09-08
lc-155 lc-155
/** Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the
2022-09-07
lc-152 lc-152
/** Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, an
2022-09-06
lc-148 lc-148
/** Given the head of a linked list, return the list after sorting it in ascending order. Example 1: Input: he
2022-09-05
44 / 50