LeetCode 题目总结 本博客不定期更新 LeetCode 题目总结,所有题目使用 Java 实现,小部分题目也提供 JavaScript 代码。我不追求一行 AC 但是我追求一题多解,比较常规的思路,解释清楚复杂度,代码可读性强。欢迎留言和评论,共同进步。这本是我自己用来复习的笔记,如果也能帮到你,那也是我的福报。 如果你想按类型刷题,可以参考我的标签。我做出的分类比 LC 官方的更细一些,比如我有如下展示的这些类型, 2020-03-18 #leetcode
[LeetCode] 二分查找模板 binary search 二分法是算法题里面一个比较基础但是很容易错的概念,一开始练习的时候由于不熟悉二分法的套路,反复出现死循环或者目标值找错,非常影响做题心情。我总结了如下几个模板。原则上这里的模板无论你使用哪一个,都可以解决二分法类型的问题,只不过有一些题目,比如寻找一个最大值/最小值的,可能某一个模板更适合,需要判断的条件较少。 如下模板是用Java实现的 模板一,找有序数组中是否存在一个目标值。注意 r 2021-01-12 #leetcode #java #binary search
[LeetCode] 2739. Total Distance Traveled A truck has two fuel tanks. You are given two integers, mainTank representing the fuel present in the main tank in liters and additionalTank representing the fuel present in the additional tank in lit 2024-04-24 #leetcode #java #math
[LeetCode] 2073. Time Needed to Buy Tickets There are n people in a line queuing to buy tickets, where the 0th person is at the front of the line and the (n - 1)th person is at the back of the line. You are given a 0-indexed integer array ticke 2024-04-09 #leetcode #array #java #simulation
[LeetCode] 2192. All Ancestors of a Node in a Directed Acyclic Graph You are given a positive integer n representing the number of nodes of a Directed Acyclic Graph (DAG). The nodes are numbered from 0 to n - 1 (inclusive). You are also given a 2D integer array edges, 2024-04-06 #leetcode #java #bfs #dfs #graph #topological sort
[LeetCode] 2962. Count Subarrays Where Max Element Appears at Least K Times You are given an integer array nums and a positive integer k. Return the number of subarrays where the maximum element of nums appears at least k times in that subarray. A subarray is a contiguous seq 2024-03-29 #leetcode #array #java #sliding window
[LeetCode] 2789. Largest Element in an Array after Merge Operations You are given a 0-indexed array nums consisting of positive integers. You can do the following operation on the array any number of times:Choose an integer i such that 0 <= i < nums.length 2024-03-14 #leetcode #array #java #greedy
[LeetCode] 2129. Capitalize the Title You are given a string title consisting of one or more words separated by a single space, where each word consists of English letters. Capitalize the string by changing the capitalization of each word 2024-03-10 #leetcode #java #string
[LeetCode] 2575. Find the Divisibility Array of a String You are given a 0-indexed string word of length n consisting of digits, and a positive integer m. The divisibility array div of word is an integer array of length n such that: div[i] = 1 if the n 2024-03-06 #leetcode #array #java #math #string #MOD
[LeetCode] 1750. Minimum Length of String After Deleting Similar Ends Given a string s consisting only of characters ‘a’, ‘b’, and ‘c’. You are asked to apply the following algorithm on the string any number of times: Pick a non-empty prefix from the string s where all 2024-03-05 #leetcode #two pointer #java #string