[daily question] Leetcode:1765 The highest point in the map

Title Description Give you an integer matrix isWater with the size of m x n, which represents a map composed of land and water cells. If i s W a t e ...

Added by griemar on Sun, 30 Jan 2022 09:20:01 +0200

LCP 16. Amusement park tour plan

LCP 16. Amusement park tour plan subject When it comes to the annual spring outing, Xiao Wu plans to visit the amusement park for one day. There are N amusement projects in the amusement park, numbered from 0 to N-1. Xiao Wu defines a non negative integer value[i] for each amusement project to represent his favorite value. There will be two- ...

Added by vynsane on Sun, 30 Jan 2022 07:53:43 +0200

Array: force deduction dichotomy problem

course: https://github.com/youngyangyang04/leetcode-master 34. Find the first and last positions of elements in the sorted array (medium) Link: https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/ Title Description: give an integer array nums arranged in ascending order and a target value target. Find ...

Added by new2code on Sat, 29 Jan 2022 22:38:33 +0200

leetcode1195. Alternate print string (java implementation)

subject Original question connection leetcode1195 Title Description: Write a program that can output a string representing this number from 1 to n, but: If this number can be divided by 3, output "fizz".If this number can be divided by 5, output "buzz".If this number can be divided by 3 and 5 at the same time, output &quot ...

Added by non_zero on Sat, 29 Jan 2022 03:08:16 +0200

1600. Order of succession to the throne - daily question

1, Title   in a kingdom lived the king, his children, his grandchildren and so on. At every point in time, someone in the family is born and someone dies.   this kingdom has a clearly defined order of succession to the throne, and the first heir is always the king himself. We define the recursive function success (x, curorder). Give ...

Added by joebarker99 on Fri, 28 Jan 2022 07:30:43 +0200

Leetcode curated SQL question brushing summary_ one

Recently, I have done 32 questions in the Easy part, which can be summarized as follows: Reading, doing questions and doing complete projects are three things; Typing the code according to the book and writing the complete code by yourself are two different things Of course, the foundation should be laid step by step, but it really needs more ...

Added by music_man on Fri, 28 Jan 2022 06:15:10 +0200

Sliding window - LeetCode

sliding window Topic introduction 76. LeetCode (LeetCode CN. Com) This topic says that we should at least ask for a substring. If we can't find a substring, How to find the shortest one, Let's assume that we have a table to record how many times each letter appears and how many times one appears, and we store it in an array, The ...

Added by Xoom3r on Fri, 28 Jan 2022 00:09:47 +0200

LeetCode questions 46-47 full arrangement 1-2

First reaction How do I feel like I've done similar problems. Compare with question 31 "next arrangement" The next permutation of an array of integers refers to the next lexicographically ordered permutation of its integers. More formally, if all permutations of an array are arranged in a container from small to large according to ...

Added by phr0stbyte on Thu, 27 Jan 2022 21:19:08 +0200

Binary tree special exercise

catalogue I Recursive traversal (1) Middle order traversal (2) Preorder traversal (3) Postorder traversal 2. Iterative method (1) Preorder traversal (2) Postorder traversal (3) Middle order traversal III level traversal 4, 226 Flip binary tree LeetCode (LeetCode CN. Com) 5, 101 Symmetric binary tree LeetCode (LeetCode CN. Com) 1. ...

Added by hackerkts on Thu, 27 Jan 2022 16:10:36 +0200

[Leetcode]124. Maximum path sum in binary tree

Title Description A path is defined as a sequence that starts from any node in the tree and connects along the parent node to the child node to reach any node. The same node can appear at most in a path sequence. Therefore, the path contains at least one node and does not necessarily pass through the root node. Path sum is the sum of the ...

Added by bhoward3 on Thu, 27 Jan 2022 07:27:55 +0200