随笔分类 -  LeetCode

解题思路记录
[LeetCode]2281. Sum of Total Strength of Wizards 计算公式推导详解（JavaScript版)
摘要：题目描述 LeetCode原题链接：2281. Sum of Total Strength of Wizards As the ruler of a kingdom, you have an army of wizards at your command. You are given a 0-ind 阅读全文
posted @ 2022-06-17 14:07 夭夭夭夭夭桃子 阅读(295) 评论(0) 推荐(0)
[LeetCode]828. Count Unique Characters of All Substrings of a Given String 动态规划转移方程详解
摘要：题目描述 LeetCode原题链接：828. Count Unique Characters of All Substrings of a Given String Let's define a function countUniqueChars(s) that returns the number 阅读全文
posted @ 2022-06-04 00:29 夭夭夭夭夭桃子 阅读(63) 评论(0) 推荐(0)
[LeetCode]818. Race Car｜BFS & DP附图详解(JavaScript版)
摘要：题目描述 LeetCode原题链接：818. Race Car Your car starts at position 0 and speed +1 on an infinite number line. Your car can go into negative positions. Your c 阅读全文
posted @ 2022-05-17 05:29 夭夭夭夭夭桃子 阅读(161) 评论(0) 推荐(0)
[LeetCode]373. Find K Pairs with Smallest Sums 动态规划解法转移方程
摘要：题目描述 LeetCode原题链接：373. Find K Pairs with Smallest Sums You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k. De 阅读全文
posted @ 2022-03-25 08:51 夭夭夭夭夭桃子 阅读(57) 评论(0) 推荐(0)
[LeetCode]1621. Number of Sets of K Non-Overlapping Line Segments 动态规划js版
摘要：题目描述 LeetCode原题链接：1621. Number of Sets of K Non-Overlapping Line Segments Given n points on a 1-D plane, where the ith point (from 0 to n-1) is at x = 阅读全文
posted @ 2022-02-27 06:06 夭夭夭夭夭桃子 阅读(99) 评论(0) 推荐(0)
[LeetCode]395. Longest Substring with At Least K Repeating Characters滑动窗口+分治(JavaScript)
摘要：题目描述 LeetCode原题链接：395. Longest Substring with At Least K Repeating Characters Given a string s and an integer k, return the length of the longest subs 阅读全文
posted @ 2022-02-14 15:21 夭夭夭夭夭桃子 阅读(99) 评论(0) 推荐(0)
[LeetCode]410. Split Array Largest Sum三种不同解法(JavaScript)
摘要：题目描述 LeetCode原题链接：410. Split Array Largest Sum Given an array nums which consists of non-negative integers and an integer m, you can split the array i 阅读全文
posted @ 2022-01-28 10:26 夭夭夭夭夭桃子 阅读(89) 评论(0) 推荐(0)
[LeetCode]1262. Greatest Sum Divisible by Three (JS) 动态规划&小学数学解法
摘要：题目描述 LeetCode原题链接：1262. Greatest Sum Divisible by Three Given an array nums of integers, we need to find the maximum possible sum of elements of the a 阅读全文
posted @ 2022-01-04 02:52 夭夭夭夭夭桃子 阅读(79) 评论(0) 推荐(0)
[LeetCode]1320. Minimum Distance to Type a Word Using Two Fingers 动态规划解法
摘要：题目描述 LeetCode原题链接：1320. Minimum Distance to Type a Word Using Two Fingers You have a keyboard layout as shown above in the X-Y plane, where each Engli 阅读全文
posted @ 2021-10-11 01:11 夭夭夭夭夭桃子 阅读(130) 评论(0) 推荐(0)
[LeetCode]642. Design Search Autocomplete System（JavaScript解法）
摘要：题目描述 LeetCode原题链接：642. Design Search Autocomplete System Design a search autocomplete system for a search engine. Users may input a sentence (at least 阅读全文
posted @ 2021-10-01 08:27 夭夭夭夭夭桃子 阅读(75) 评论(0) 推荐(0)
LeetCode解题思路汇总
摘要：LeetCode解题思路汇总（loading......） 做个记录啦📝 4 Hard Median of Two Sorted Arrays 10 Hard Regular Expression Matching 221 Medium Maximal Square 222 Medium Coun 阅读全文
posted @ 2021-09-30 03:23 夭夭夭夭夭桃子 阅读(123) 评论(0) 推荐(0)
[LeetCode]221. Maximal Square 动态规划解法转移方程
摘要：题目描述 LeetCode原题链接：221. Maximal Square Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its 阅读全文
posted @ 2021-08-21 07:56 夭夭夭夭夭桃子 阅读(103) 评论(0) 推荐(0)
[LeetCode]222. Count Complete Tree Nodes 左右分区算法解析
摘要：题目描述 LeetCode原题链接：222. Count Complete Tree Nodes Given the root of a complete binary tree, return the number of the nodes in the tree. According to Wi 阅读全文
posted @ 2021-07-27 22:57 夭夭夭夭夭桃子 阅读(97) 评论(0) 推荐(0)
[LeetCode]10. Regular Expression Matching 动态规划转移方程解析
摘要：题目描述 LeetCode原题链接：10. Regular Expression Matching Given an input string s and a pattern p, implement regular expression matching with support for '.'  阅读全文
posted @ 2021-07-17 18:12 夭夭夭夭夭桃子 阅读(104) 评论(0) 推荐(0)
[LeetCode]4. Median of Two Sorted Arrays 二分法求中位数图解
摘要：题目描述 LeetCode原题链接：4. Median of Two Sorted Arrays Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two so 阅读全文
posted @ 2021-07-11 11:32 夭夭夭夭夭桃子 阅读(183) 评论(0) 推荐(0)
[LeetCode]287. Find the Duplicate Number 图解Floyd判圈(龟兔赛跑)算法
摘要：题目描述 LeetCode原题链接：287. Find the Duplicate Number Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] i 阅读全文
posted @ 2021-07-10 16:20 夭夭夭夭夭桃子 阅读(196) 评论(0) 推荐(0)