随笔分类 - 编程篇 / leetcode
长写代码手不抖
摘要：题目描述 链接：https://leetcode.com/problems/maximum-length-of-repeated-subarray/description/ Given two integer arrays nums1 and nums2, return the maximum le
阅读全文
摘要：问题描述 Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionar
阅读全文
摘要：问题描述 链接：https://leetcode.com/problems/unique-binary-search-trees/description/ Given an integer n, return the number of structurally unique BST's (bina
阅读全文
摘要：问题描述 链接： https://leetcode.com/problems/longest-increasing-subsequence/description/ Given an integer array nums, return the length of the longest stric
阅读全文
摘要：问题描述 链接： https://leetcode.com/problems/longest-palindromic-substring/description/ Given a string s, return the longest palindromic substring in s 解释：
阅读全文
摘要：问题描述 链接：https://leetcode.com/problems/coin-change-ii/ You are given an integer array coins representing coins of different denominations and an intege
阅读全文
摘要：题目描述 链接：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/ Ｙou are given an integer array prices where prices[i] is the pri
阅读全文
摘要：问题描述 You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Re
阅读全文
摘要：目录基础练习题具体题目二叉树排序双指针法类型1：一个头指针，一个尾指针，不断缩小搜索空间类型2：快慢指针法链表动态规划二分搜索排序数组排序基于交换的排序冒泡排序快速排序基于插入的排序插入排序基于选择的排序选择排序二路归并排序链表排序搜索二分搜索二叉树的遍历深度优先遍历先序遍历中序遍历后序遍历广度优先
阅读全文
摘要：问题描述 An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5. Given an integer n, return the nth *ugly number*. 解释： 一个丑数是一
阅读全文
摘要：64 - Minimum Path Sum 最小路径和 问题描述 Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the s
阅读全文
摘要：题目描述 Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. You have the following three opera
阅读全文
摘要：45_jump Game II 跳跃游戏II 问题描述 链接：https://leetcode.com/problems/jump-game-ii/description/ You are given a 0-indexed array of integers nums of length n. Y
阅读全文
摘要：问题描述 You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maxim
阅读全文
摘要：42 -Trapping Rain Water 接雨水 问题描述 链接：https://leetcode.com/problems/trapping-rain-water/description/ Given n non-negative integers representing an eleva
阅读全文
摘要：问题描述 Given an integer array nums, find the subarray with the largest sum, and return its sum. 给定一个数组nums， 找到一个子数组。使它的和最大，返回子数组 例子 Input: nums = [-2,1,
阅读全文
摘要：最长递增子序列 连接：https://leetcode.com/problems/longest-increasing-subsequence/description/ 问题描述 Given an integer array nums, return the length of the longes
阅读全文
