64. Minimum Path Sum 题目 Given a m x n grid filled with non-negative numbers, find a path from top left to bott…
分类:LeetCode题目解答
106. Construct Binary Tree from Inorder and Postorder Traversal
欢迎fork and star:Nowcoder-Repository-github 106. Construct Binary Tree from Inorder and Postorder Traversal 题目 …
[LeetCode] Second Highest Salary 第二高薪水
Write a SQL query to get the second highest salary from the Employee table. +----+--------+ |…
LeetCode 235 Lowest Common Ancestor of a Binary Search Tree
题目描述 Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. Ac…
208. Implement Trie (Prefix Tree)
Implement a trie with insert, search, and startsWith methods. Example: Trie trie = new Trie(); trie.insert("ap…
25. Reverse Nodes in k-Group
25. Reverse Nodes in k-Group 题目 Given a linked list, reverse the nodes of a linked list k at a time and return…
[LeetCode] Trips and Users 旅行和用户
The Trips table holds all taxi trips. Each trip has a unique Id, while Client_Id and Driver_I…
[LeetCode] Rabbits in Forest 森林里的兔子
In a forest, each rabbit has some color. Some subset of rabbits (possibly all of them) tell you how man…
LeetCode 035 Search Insert Position
题目描述 Given a sorted array and a target value, return the index if the target is found. If not, return the inde…
[Leetcode] Multiply String and Big Interger 大数乘法加法减法
Multiply Strings Given two numbers represented as strings, return multiplication of the numbers as a string. N…
[LeetCode] Arithmetic Slices 算数切片
A sequence of number is called arithmetic if it consists of at least three elements and if the differen…
【leetcode】28. Implement strStr() 字符串匹配KMP BM
1. 题目 Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is …