qq_38932841的博客

原创 Leetcode题目集合

基础数据结构概念，基本操作，以及优缺点等 　 　 　 　 　 1 字符串操作（标准库，解析，匹配等） 包含 包含 包含 　 　 　 学习材料：https://leetcode-cn.com/explore/learn/card/array-and-string/ 　 3.无重复字符的最长子串 中等 https://leetcode-cn.com/problems/longest-substring-withou

原创 专业知识学习网站

专业知识学习网站。

原创 jd gui 提示The application requires a Java Runtime Environment 1.8.0，设置jdk路径

jd gui 提示The application requires a Java Runtime Environment 1.8.0，设置jdk路径

原创 407. 接雨水 II

题目：https://leetcode-cn.com/problems/trapping-rain-water-ii/import java.util.Comparator;import java.util.PriorityQueue;public class _407_TrapRainWater { public class Location { int row, col, height; public Location(int row, int

原创 215. 数组中的第K个最大元素

题目：https://leetcode-cn.com/problems/kth-largest-element-in-an-array/public class _215_FindKthLargest { public int findKthLargest(int[] nums, int k) { int len = nums.length; return quickSelect(nums, 0, len - 1, k - 1); } pu

原创 98. 验证二叉搜索树

题目:https://leetcode-cn.com/problems/validate-binary-search-tree/import java.util.ArrayList;import java.util.List;public class _98_IsValidBST { private List<Integer> list; public boolean isValidBST(TreeNode root) { list = new

原创 198. 打家劫舍

题目：https://leetcode-cn.com/problems/house-robber/public class _198_Rob { public int rob(int[] nums) { int len = nums.length; int[] dp = new int[len]; for (int i = 0; i < len; i++) { if(i==0) {

原创 230. 二叉搜索树中第K小的元素

题目：https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst/

原创 IDEA添加工具栏【后退、前进】、编辑器右键菜单【格式化代码】

原创 55. 跳跃游戏

题目：https://leetcode-cn.com/problems/jump-game/public class _55_CanJump { // 贪心算法 public boolean canJump(int[] nums) { int len = nums.length; int rightMost = 0; for (int i = 0; i < len; i++) { if (i <=

原创 56. 合并区间

题目：https://leetcode-cn.com/problems/merge-intervals/import java.util.ArrayList;import java.util.Arrays;import java.util.Comparator;public class _56_Merge { public static int[][] merge(int[][] intervals) { Arrays.sort(intervals, new Compar

原创 239. 滑动窗口最大值

题目：https://leetcode-cn.com/problems/sliding-window-maximum/import java.util.*;public class _239_MaxSlidingWindow { // 优先队列-大根堆 public int[] maxSlidingWindow(int[] nums, int k) { int len = nums.length; int[] ans = new int[len

原创 997. 找到小镇的法官

题目：https://leetcode-cn.com/problems/find-the-town-judge/import java.util.ArrayList;import java.util.HashMap;import java.util.List;import java.util.Map;public class _997_FindJudge { public int findJudge(int n, int[][] trust) { if (n ==

原创 102. 二叉树的层序遍历

题目：https://leetcode-cn.com/problems/binary-tree-level-order-traversal/import java.util.ArrayList;import java.util.LinkedList;import java.util.List;import java.util.Queue;public class _102_LevelOrder { public List<List<Integer>> le

原创 144. 二叉树的前序遍历

题目：https://leetcode-cn.com/problems/binary-tree-preorder-traversal/import java.util.ArrayList;import java.util.List;public class _144_PreorderTraversal { List<Integer> ans; public List<Integer> preorderTraversal(TreeNode root) {

原创 652. 寻找重复的子树

题目：https://leetcode-cn.com/problems/find-duplicate-subtrees/import java.util.*;public class _652_FindDuplicateSubtrees { private Map<String, Integer> map; private List<TreeNode> ans; public List<TreeNode> findDuplicateS

原创 36. 有效的数独

题目：https://leetcode-cn.com/problems/valid-sudoku/import java.util.ArrayList;import java.util.HashMap;import java.util.List;import java.util.Map;public class _36_IsValidSudoku { public boolean isValidSudoku(char[][] board) { Map<Int

原创 49. 字母异位词分组

题目：https://leetcode-cn.com/problems/group-anagrams/import java.util.*;public class _49_GroupAnagrams { // 先排序，再用map public List<List<String>> groupAnagrams(String[] strs) { Map<String, List<String>> map = new

原创 18. 四数之和

题目：https://leetcode-cn.com/problems/4sum/import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class _18_FourSum { // 排序+双指针 public List<List<Integer>> fourSum(int[] nums, int target) { List&lt

原创 387. 字符串中的第一个唯一字符

题目：https://leetcode-cn.com/problems/first-unique-character-in-a-string/import java.util.HashMap;import java.util.LinkedHashMap;import java.util.Map;public class _387_FirstUniqChar { public int firstUniqChar(String s) { Map<Character

原创 706. 设计哈希映射

题目：https://leetcode-cn.com/problems/design-hashmap/import java.util.ArrayList;import java.util.List;public class _706_MyHashMap { private List<Integer> valueList; private List<Integer> keyList; public _706_MyHashMap() {

原创 705. 设计哈希集合

题目：https://leetcode-cn.com/problems/design-hashset/import java.util.ArrayList;import java.util.List;public class _705_MyHashSet { private List<Integer> list; public _705_MyHashSet() { list = new ArrayList<>(); }

原创 23. 合并K个升序链表

题目：https://leetcode-cn.com/problems/merge-k-sorted-lists/public class _23_MergeKLists { public ListNode mergeKLists(ListNode[] lists) { if(lists.length == 0) { return null; } if(lists.length == 2) {

原创 19. 删除链表的倒数第 N 个结点

题目：https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/import java.util.ArrayDeque;import java.util.ArrayList;import java.util.Deque;import java.util.Stack;public class _19_RemoveNthFromEnd { // 计算ListNode长度 public ListNode

原创 160. 相交链表

题目：https://leetcode-cn.com/problems/intersection-of-two-linked-lists/import java.util.HashMap;import java.util.HashSet;public class _160_GetIntersectionNode { // 哈希集合 public ListNode getIntersectionNode(ListNode headA, ListNode headB) {

原创 142. 环形链表 II

题目：https://leetcode-cn.com/problems/linked-list-cycle-ii/import java.util.ArrayList;import java.util.List;public class _142_DetectCycle { public ListNode detectCycle(ListNode head) { if (head == null) { return null;

原创 141. 环形链表

题目：https://leetcode-cn.com/problems/linked-list-cycle/import java.util.ArrayList;import java.util.List;public class _141_HasCycle { // 哈希散列表 public boolean hasCycle(ListNode head) { List<ListNode> list = new ArrayList<>(

原创 707. 设计链表

题目：https://leetcode-cn.com/problems/design-linked-list/import java.util.ArrayList;public class _707_MyLinkedList { private ArrayList<Integer> list; public _707_MyLinkedList() { list = new ArrayList<>(); } public

原创 84. 柱状图中最大的矩形

题目：https://leetcode-cn.com/problems/largest-rectangle-in-histogram/import java.util.Arrays;import java.util.Stack;public class _84_LargestRectangleArea { // 单调栈（双侧） public int largestRectangleArea(int[] heights) { int len = heights.

原创 42. 接雨水

题目：https://leetcode-cn.com/problems/trapping-rain-water/import java.util.Stack;public class _42_TrapWater { // 动态规划 public int trap1(int[] height) { if (height.length == 0) { return 0; } int[] leftMax = ne

原创 150. 逆波兰表达式求值

题目：https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/import java.util.ArrayDeque;import java.util.Deque;public class _150_EvalRPN { public int evalRPN(String[] tokens) { Deque<Integer> deque = new ArrayDeque<&gt

原创 71. 简化路径

题目：https://leetcode-cn.com/problems/simplify-path/import java.util.ArrayDeque;import java.util.Deque;public class _71_SimplifyPath { public String simplifyPath(String path) { Deque<String> stack = new ArrayDeque<>();

原创 739. 每日温度

题目：https://leetcode-cn.com/problems/daily-temperatures/import java.util.Stack;public class _739_DailyTemperatures { public int[] dailyTemperatures(int[] temperatures) { Stack<Integer> stack = new Stack<>(); int[] resu

原创 20. 有效的括号

题目：https://leetcode-cn.com/problems/valid-parentheses/import java.util.Stack;public class _20_IsValid { public boolean isValid(String s) { Stack brackets = new Stack<Character>(); for (int i = 0; i < s.length(); i++) {

原创 155. 最小栈

题目：https://leetcode-cn.com/problems/min-stack/import java.util.ArrayList;import java.util.Stack;public class _155_MinStack { /** * initialize your data structure here. */ public ArrayList<Integer> list; public Stack<I

原创 933. 最近的请求次数

题目：https://leetcode-cn.com/problems/number-of-recent-calls/import java.util.ArrayDeque;import java.util.ArrayList;import java.util.Deque;import java.util.List;public class _933_RecentCounter { Deque<Integer> deque; List<Integer&g

原创 363. 矩形区域不超过 K 的最大数值和

题目：https://leetcode-cn.com/problems/max-sum-of-rectangle-no-larger-than-k/public class _363_MaxSumSubmatrix { public int maxSumSubmatrix(int[][] matrix, int k) { int rows = matrix.length; int cols = matrix[0].length; int ma

原创 641. 设计循环双端队列

题目：https://leetcode-cn.com/problems/design-circular-deque/import java.util.ArrayDeque;import java.util.Deque;class _641_MyCircularDeque { private Deque<Integer> deque; private int scale; public _641_MyCircularDeque(int k) {

原创 621. 任务调度器

题目：https://leetcode-cn.com/problems/task-scheduler/

原创 225. 用队列实现栈

题目：https://leetcode-cn.com/problems/implement-stack-using-queues/import java.util.ArrayDeque;import java.util.Deque;public class _225_MyStack { private Deque<Integer> deque; /** Initialize your data structure here. */ public _225