Leetcode 695. Maximum area of the island

subject Give you a binary matrix grid of size m x n. An island is a combination of some adjacent 1s (representing land). The "adjacent" here requires that two 1s must be adjacent in four horizontal or vertical directions. You can assume that the four edges of the grid are surrounded by 0 (representing water). The area of an island ...

Posted on Wed, 13 Oct 2021 13:19:31 -0400 by $0.05$

leetcode brush Title records day024:20 and 118

20. Easy to use: 45% pass rate Method 1: Origin: Failed Violence: For my own future review, there are all kinds of situations that I did not think of at first but follow up and corresponding responses Principle: Normally judge if the current item and the next item are a bunch of parentheses, and add the response of the left parentheses group ...

Posted on Tue, 12 Oct 2021 15:49:40 -0400 by vronsky

c language to realize dynamic compatibilization array stack

1, Overview Stack is sometimes used in daily development, such as reducing recursive functions to non recursive loops, or parsing xml tags. The c language standard library does not have a stack structure. Here is a stack implementation method, which is based on array implementation and supports dynamic capacity expansion. 2, Principle descrip ...

Posted on Thu, 07 Oct 2021 22:10:02 -0400 by ifuschini

Application of stack (stack legitimacy / Integer Decomposition into several items and / Full Permutation / prefix expression) data structure C language version

7-16 legality of stack operation (20 points) Suppose s and x represent the stack in and stack out operations respectively. If an empty stack is operated according to a sequence consisting only of S and X, the corresponding operations are feasible (e.g. the stack is empty when there is no deletion) and the final state is also empty, the sequenc ...

Posted on Tue, 05 Oct 2021 14:54:20 -0400 by Skippy93

Structural characteristics and basic operation of data structure stack

Structure characteristics and operation of stack Stack is a linear table that can only be inserted and deleted at one end of the table. In the table, the end that allows insertion and deletion is called "top of the stack", and the end that does not allow insertion and deletion is called "bottom of the stack". The elements i ...

Posted on Mon, 04 Oct 2021 21:55:50 -0400 by mona02

Data structures (stacks and queues)

Relationship between stack and queue and linear table Stack and queue are two important linear structures. Stack and queue are also linear tables. Their particularity is that the basic operations of stack and queue are subsets of linear table operations. They are linear tables with limited operations. Stack Definition of abstract data type s ...

Posted on Wed, 29 Sep 2021 16:34:07 -0400 by Zay

[algorithm LeetCode] 155. Minimum stack (stack; array)

155. Minimum stack force buckle (LeetCode) Released: 17:29:18, September 22, 2021 Problem description and examples Design a stack that supports push, pop and top operations and can retrieve the smallest element in a constant time. push(x) -- pushes element x onto the stack. pop() -- delete the element at the top of the stack. top() -- get ...

Posted on Wed, 22 Sep 2021 12:56:04 -0400 by cola