倪春恩的博客
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
lc-146 lc-146
/** Design a data structure that follows the constraints of a Least Recently Used ( LRU) cache. Implement the LRUCache
2022-09-05
lc-142 lc-142
/** Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. Ther
2022-09-01
lc-141 lc-141
/** Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a lin
2022-08-31
lc-139 lc-139
/** Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequ
2022-08-30
lc-136 lc-136
/** Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You
2022-08-29
lc-128 lc-128
/** Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You mu
2022-08-26
lc-124 lc-124
/** A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connec
2022-08-25
lc-121 lc-121
/** You are given an array prices where prices[i] is the price of a given stock on the iᵗʰ day. You want to maximize
2022-08-24
35 / 39