Siqi Liu
Siqi Liu
中文
Avatar
😀
ai blockchain database design patterns digitaltwin frontend frontend hook investment javascript javascript leetcode life node.js oop optimization react review project technology vue web

  • 1104-Binary Tree Pathfinding

    The first thing I thought of was to construct a binary tree, and then use the symmetric relationship of each layer to find the parent node var pathInZigZagTree = function(label) { let stack = [] for …
    leetcode Created Thu, 29 Jul 2021 00:00:00 +0000

  • 1893-Check if all integers in the region are covered

    I didn’t think of any good way to get it, so I used brute force to solve it first. var isCovered = function(ranges, left, right) { for(let i = left ; i <= right ; i ++) { let include = false for(let …
    leetcode Created Fri, 23 Jul 2021 00:00:00 +0000

  • Reverse Linked List 2

    Considering that the head may also be reversed, a dummy head is needed. During the traversal process, the tail node after the reversal and the previous node are recorded. Finally, the node link …
    leetcode Created Fri, 23 Jul 2021 00:00:00 +0000

  • 138-Copying a linked list with random pointers

    The idea behind the question is to use double pointers to point to the old and new nodes, and then add a map to map the old and new nodes. recursion var listMap = new Map() var copyRandomList = …
    leetcode Created Thu, 22 Jul 2021 00:00:00 +0000

  • 684-Redundant Connection

    Time: 15 minutes Use the union-find template var findRedundantConnection = function(edges) { var n = edges.length var fa = new Array(n + 1) var find = function (x) { if (x != fa[x]) { fa[x] = …
    leetcode Created Wed, 07 Jul 2021 00:00:00 +0000

  • 1202-Swap elements in a string

    It is mainly used for learning and checking ideas, and you will start only after looking at the answers. The idea is to group the interchangeable strings first, sort the groups, and then combine them …
    leetcode Created Tue, 06 Jul 2021 00:00:00 +0000

  • 778-Swimming in a rising pool

    Time: 20 minutes First of all, it can be seen that this is a question to examine DFS var swimInWater = function(grid) { let row = grid.length; let col = grid[0].length; var step = 0 while(true) { …
    leetcode Created Mon, 05 Jul 2021 00:00:00 +0000

  • 475-Heater

    The first thing that comes to mind is to find the distance r of all heaters that are the shortest distance from the house, and then return the largest r var findRadius = function(houses, heaters) { …
    leetcode Created Thu, 10 Jun 2021 00:00:00 +0000

  • 875-Keke who loves bananas

    Time: 60 minutes The quickest way of thinking when getting the question is to enumerate all the speeds at which bananas can be eaten and find the minimum speed at which all bananas can be eaten. The …
    leetcode Created Wed, 28 Apr 2021 00:00:00 +0000

  • 973-K points closest to the origin

    Time: 15 minutes There is nothing much to say about conventional heap sort class Heap { constructor(list, compare = (a, b) => a - b) { this.left = index => 2 * index + 1 this.right = index => 2 * …
    leetcode Created Sat, 10 Apr 2021 00:00:00 +0000
Previous Next