贫道绝缘子的博客

个人笔记

A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.

Given a string s, return true if it is possible to split the string s into three non-empty palindromic substrings. Otherwise, return false.​​​​​

You are given a string s containing lowercase letters and an integer k. You need to : First, change some characters of s to other lowercase English letters. Then divide s into k non-empty disjoint substrings such that each substring is a palindrome.

Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s.

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.

The variance of a string is defined as the largest difference between the number of occurrences of any 2 characters present in the string.

Leetcode-853. Car Fleet

Leetcode-1776. Car Fleet II

Given an m x n integer matrix heightMap representing the height of each unit cell in a 2D elevation map, return the volume of water it can trap after raining.

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Given three integers m, n, and k, return the kth smallest element in the m x n multiplication table.

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 in the histogram.

Given a binary filled with 's and 's, find the largest rectangle containing only 's and return its area.

输入一个只包含0和1的字符串表示二叉树，输出每个节点能到达的最远距离，通过父节点的路径也要考虑。比如输入"111110000010000", 输出[3,2,4,3,3,4]。

【代码】LeetCode-493. Reverse Pairs。

Given an integer arraynums, returnan integer arraycountswherecounts[i]is the number of smaller elements to the right ofnums[i].

You have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at least one number from each of the k lists.

Given therootof aperfectbinary tree, reverse the node values at eachoddlevel of the tree.

图是树的升级版。图通常分为有向（directed）或无向（undirected），有循环（cyclic）或无循环（acyclic），所有节点相连（connected）或不相连（disconnected）。

Design a data structure to store the strings' count with the ability to return the strings with minimum and maximum counts.

You must implement the functions of the class such that each function works inaverageO(1)time complexity.

Design a data structure that follows the constraints of aLeast Recently Used (LRU) cache.

You are given a graph that started as a tree withnnodes labeled from1ton, with one additional edge added. The added edge has twodifferentvertices chosen from1ton, and was not an edge that already existed. The graph is represented as an arrayedge

In thisnew graph, you want to know how many nodes arereachablefrom the node0, where a node isreachableif the distance ismaxMovesor less.Given the original graph andmaxMoves, returnthe number of nodes that arereachablefrom node0in the new gr

Return the minimum cost so that for every pair of cities, there exists a pathof connections (possibly of length 1) that connects those two cities together. The cost is the sum of the connection costs used. If the task is impossible, return -1.

Given the edges of a directed graph, and two nodes source and destination of this graph, determine whether or not all paths starting from source eventually end at destination,this problem is pretty straight forward.

There are a total ofnumCoursescourses you have to take, labeled from0tonumCourses - 1. You are given an arrayprerequisiteswhereprerequisites[i] = [ai, bi]indicates that youmusttake coursebifirst if you want to take courseai. reuturn true .......

There is anundirectedgraph withnnodes, where each node is numbered between0andn - 1. You are given a 2D arraygraph, wheregraph[u]is an array of nodes that nodeuis adjacent to. More formally, for eachvingraph[u], there is an undirected edge b...

There are a total ofnumCoursescourses you have to take, labeled from0tonumCourses - 1. You are given an arrayprerequisiteswhereprerequisites[i] = [ai, bi]indicates that youmusttake coursebifirst if you want to take courseai.

作为（单）链表的升级版，我们通常接触的树都是二叉树（binary tree），即每个节点最多有两个子节点；且除非题目说明，默认树中不存在循环结构。

Given a root node reference of a BST and a key, delete the node with the given key in the BST. Returntheroot node reference(possibly updated) of the BST.

Given therootof a Binary Search Tree and a target numberk, returntrueif there exist two elements in the BST such that their sum is equal to the given target.

Given therootof a binary search tree, rearrange the tree inin-orderso that the leftmost node in the tree is now the root of the tree, and every node has no left child and only one right child.

Given theheadof a singly linked list where elements aresorted in ascending order, convert it to a height balanced BST.

Given therootof abinary tree, returnthe postorder traversal of its nodes' values.

Given therootof a binary tree, returnthe inorder traversal of its nodes' values.

Given two integer arraysinorderandpostorderwhereinorderis the inorder traversal of a binary tree andpostorderis the postorder traversal of the same tree, construct and returnthe binary tree.

Given two integer arrays,preorderandpostorderwherepreorderis the preorder traversal of a binary tree ofdistinctvalues andpostorderis the postorder traversal of the same tree, reconstruct and returnthe binary tree.

Given therootof a Binary Search Tree (BST), returnthe minimum absolute difference between the values of any two different nodes in the tree.