2021-12-14 [Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3)]

A. Life of a Flower Title Description Petya has an interesting flower. Petya is a busy man, so she sometimes forgets to water. From the beginning of Petya's life, you have n days. You must determine what happened to his flowers in the end. The flowers grow as follows: If the flower is not watered for two consecutive days, it will die. If th ...

Posted by niranjnn01 on Tue, 14 Dec 2021 10:30:30 +0100

Data structure notes - single linked list and two-way linked list

This blog is a learning note written after learning according to the data structure tutorial of Shang Silicon Valley teacher in station b Some concepts and pictures are from videos. The code and screenshots are done by yourself. The focus of this blog is on the code comments written by yourself Shang Silicon Valley Java data structure and Java ...

Posted by ThunderLee on Mon, 13 Dec 2021 15:47:59 +0100

Linked list must brush questions: speed double pointer, linked list reverse, find the midpoint template·····

234. Palindrome linked list Very representative! It includes linked list traversal, fast and slow pointer, midpoint template, linked list data comparison and linked list inversion! Very representative class Solution { public boolean isPalindrome(ListNode head) { if(head == null || head.next == null) return true; // Fi ...

Posted by luisantonio on Mon, 13 Dec 2021 15:36:32 +0100

C + + circular queue

Summary A queue is actually a queue in real life. The people at the head of the queue go first and the newcomers line up at the end of the queue. First in, first out, last in, last out.The implementation of queue requires a team head pointer and a team tail pointer for entering and leaving the team. For circular queues, during initializati ...

Posted by Asperon on Mon, 13 Dec 2021 06:33:55 +0100

A week in the Software Association

Fight with algorithms After a week of algorithm battle, I finally touched the tail of the algorithm (although the algorithm seems to have no tail). Next, I'll summarize my harvest: 1. Review of ranking Understanding of sorting algorithm: 1. Bucket sorting: you need an array with three variables. Note that the size of the array is the maximum ...

Posted by flashpipe on Sun, 12 Dec 2021 21:03:38 +0100

In the era of saas craze, workflow seems to be a professional quality

preface Now more and more projects begin to use workflow to meet their daily work. Today, let's take a look at the workflow of Activiti. Let's start with BPMN painting Environment installation BPMN documents about processes are mainly integrated through eclipse development tools. The idea is mainly painted by actiBPM, but actiBPM is no long ...

Posted by shwanky on Sun, 12 Dec 2021 09:34:18 +0100

Advanced level of graph of data structure and algorithm (directed graph, topological sorting, weighted undirected graph, minimum spanning tree, weighted directed graph, shortest path)

1, Directed graph In real life, many application related graphs are directional. The most intuitive is the network. You can jump from page a to page B through links. Then the direction of a and B connection is a - > b, but it can not be said to be B - > A. at this time, we need to use a directed graph to solve this kind of problem. T ...

Posted by jassh on Sat, 11 Dec 2021 12:49:10 +0100

Modify the lazy list using epoch based reclamation (EBR, a method of domain specific reclamation)

As mentioned earlier, the biggest hidden danger of lazy list is logical deletion, but there is no physical deletion problem. Therefore, EBR first solve d this problem to him. I EBR modification int parse_delete(intset_l_t *set, val_t val) { node_l_t *pred, *curr; int result, validated, isVal; while(1) { //Init pred ...

Posted by jonmkim on Sat, 11 Dec 2021 07:53:27 +0100

Stack and Queue (Sequential Storage)

Because of the lack of c language library functions, when doing some arithmetic problems, when you want to call some functions of the data structure, you always have to tap them manually or look around, so I think why not summarize some commonly used functions into it. When you write down a small book, you can only use Ctrl+C,V once (doge) to i ...

Posted by vboyz on Fri, 10 Dec 2021 18:05:11 +0100

Data Structure - [Implement and Find]

Before we started learning and collecting, we also looked for some information in advance. Recommend this blogger's article; Explain and collect easy to understand. Know the blogger: Pecco --> Algorithmic Learning Notes (1): and collect Can be used and collected to solve node connection problems on the network; Specifically speaking r ...

Posted by dawnrae on Thu, 09 Dec 2021 18:52:32 +0100