## MOOC_ Zhejiang big data structure_ Linear table, stack, queue (sequential storage and chain storage)

Linear table The most common method in data structure: array storage / linked list storage A linear table is a linear structure of an ordered sequence of data elements of the same type characteristic: Number of elements in the table - length of linear tableWhen there are no elements in the tablUTF-8...

Posted by dscuber9000 on Mon, 20 Sep 2021 15:25:42 +0530

## Data structure and algorithm series note 9: dynamic programming

dynamic programming 1. Concept Dynamic programming: dynamic programming is nothing more than using historical records to avoid repeated calculations. We need some variables to save these history records, usually with one-dimensional array or two-dimensional array. Three steps of dynamic planninUTF-8...

Posted by edawson003 on Mon, 20 Sep 2021 20:00:44 +0530

## Business (Water) (and Search + Backpack)

Be in business ProblemDiscussionsView submissions from othersMy Submission Title: NC14348 Time limit: C/C++ 1 second, 2 seconds for other languages Space limitations: C/C++ 32768K, other languages 65536K 64bit IO Format: %lld Title Description Xiao d is a local tyrant in real estate. Everyone hUTF-8...

Posted by linux1880 on Tue, 21 Sep 2021 01:17:09 +0530

## 2014 longest subsequence repeated K times

Supplementary questions for game 259 2014. Longest subsequence repeated K times Give you a string s of length n and an integer k. Please find the longest subsequence repeated k times in string s. A subsequence is a string derived from other strings with some (or no) characters deleted. If seq *UTF-8...

Posted by jdorma0 on Tue, 21 Sep 2021 01:50:37 +0530

## Data structure (7. Huffman tree)

catalogue 1, Huffman tree 2, Huffman coding implementation 1, Huffman tree Huffman tree, also known as the optimal tree, is a kind of tree with the shortest weighted path length. This paper discusses the optimal binary tree. Here are some noun concepts. Path: a branch from one node to another iUTF-8...

Posted by delboy1978uk on Tue, 21 Sep 2021 02:34:18 +0530

## Data structure: dictionary tree: do you turn to the dictionary on site during the written test?

The dictionary tree is similar to a binary tree, and its internal structure is not complex. In terms of prefix, try bailing, but there are not as many changes as red black tree and AVL. Code it quickly 1, Introduction to dictionary tree The dictionary tree is not dead. In fact, it is changeablUTF-8...

Posted by soshea on Tue, 21 Sep 2021 14:48:16 +0530

## Leecode - brush algorithm questions together - stack (minimum stack) problem and the K-th largest element in the array

Aside: today is September 21, 2021. On the occasion of the Mid Autumn Festival, I wish you a happy holiday and a happy family! Today, I want to summarize how to quickly master the algorithm in Leecode. PS today, I stroked the algorithm topics in Leecode, with a total of about 2050 questions. HoUTF-8...

Posted by Shroder on Tue, 21 Sep 2021 22:22:06 +0530

## [summary] Java set (Map)

Map 01 / HashMap In JDK8, the bottom layer of HashMap is realized by "array + linked list + red black tree". When learning the principle of HashMap, we should focus on its data structure, put process and capacity expansion mechanism. Source code interpretation: Data structure: At the beginning,UTF-8...

Posted by prent327 on Wed, 22 Sep 2021 03:33:42 +0530