摘要：
剑指offer 对称二叉树 阅读全文
posted @ 2022-11-19 18:56
MarkLeeBYR
阅读(12)
评论(0)
推荐(0)
摘要：
Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only 阅读全文
posted @ 2022-11-19 18:12
MarkLeeBYR
阅读(17)
评论(0)
推荐(0)
摘要：
//Solution 1：递归 public List<Integer> inorderTraversal(TreeNode root) { List<Integer> list =new ArrayList<>(); addNode(list, root); return list;}privat 阅读全文
posted @ 2022-11-19 14:42
MarkLeeBYR
阅读(14)
评论(0)
推荐(0)
摘要：
Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle 阅读全文
posted @ 2022-11-15 14:01
MarkLeeBYR
阅读(21)
评论(0)
推荐(0)
摘要：
给你一个字符串 s 、一个字符串 t 。返回 s 中涵盖 t 所有字符的最小子串。如果 s 中不存在涵盖 t 所有字符的子串，则返回空字符串 输入：s = "ADOBECODEBANC", t = "ABC"输出："BANC"解释：最小覆盖子串 "BANC" 包含来自字符串 t 的 'A'、'B' 阅读全文
posted @ 2022-11-14 10:25
MarkLeeBYR
阅读(36)
评论(0)
推荐(0)
摘要：
剑指offer 矩阵中的路径 https://www.cnblogs.com/MarkLeeBYR/p/9773357.html 阅读全文
posted @ 2022-11-13 21:59
MarkLeeBYR
阅读(16)
评论(0)
推荐(0)
摘要：
样例输入{1,8,5,4} 输出 [[], [1], [1, 4], [1, 4, 5], [1, 4, 5, 8], [1, 4, 8], [1, 5], [1, 5, 8], [1, 8], [4], [4, 5], [4, 5, 8], [4, 8], [5], [5, 8], [8]] 注意 阅读全文
posted @ 2022-11-13 21:55
MarkLeeBYR
阅读(23)
评论(0)
推荐(0)
摘要：
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, 阅读全文
posted @ 2022-11-13 21:26
MarkLeeBYR
阅读(16)
评论(0)
推荐(0)
摘要：
剑指offer 二维数组中的查找 https://www.cnblogs.com/MarkLeeBYR/p/9777341.html 阅读全文
posted @ 2022-11-13 20:39
MarkLeeBYR
阅读(11)
评论(0)
推荐(0)
摘要：
iven a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. click to show follow up. //如果某个元素为0，则把该元素所在的行和列都设为0。本题用了o 阅读全文
posted @ 2022-11-13 20:08
MarkLeeBYR
阅读(19)
评论(0)
推荐(0)
浙公网安备 33010602011771号