Tag:Team leader

  • [PHP data structure] logical operations related to queues

    Time:2021-10-17

    In the logical structure, we have learned a very classic structure type: stack. Today, let’s learn another classic logical structure type: queue. I believe many students have used cache queue tools such as redis and rabbitmq. In fact, database and program code can realize the operation of queue. Just like stack, queue also has its […]

  • [detailed illustration] learning queue, just read this one!

    Time:2021-9-13

    Key points: This paper mainly introduces the structure, basic principle and operation of queue, involving two implementations: sequential queue and chain queue. 1. What is a queue? Let’s take a daily example and queue up to buy food. Everyone lined up in front of the window to buy food in the order of first come, […]

  • Implementing queues in JavaScript

    Time:2021-9-11

    As an excellent programmer, you need to have a wide range of knowledge. The first is to understand the programming language you choose. If you are reading this article, you are most likely to use JavaScript. However, after you are familiar with the programming language, you must also understand how to manipulate data easily and […]

  • Let’s talk about where and filter operation of flick table

    Time:2021-8-19

    order This paper mainly studies the where and filter operations of the flick table Table flink-table_2.11-1.7.0-sources.jar!/org/apache/flink/table/api/table.scala class Table( private[flink] val tableEnv: TableEnvironment, private[flink] val logicalPlan: LogicalNode) { //…… def where(predicate: String): Table = { filter(predicate) } def where(predicate: Expression): Table = { filter(predicate) } def filter(predicate: String): Table = { val predicateExpr = ExpressionParser.parseExpression(predicate) filter(predicateExpr) […]

  • Talk about the groupby operation of the flick table

    Time:2021-8-18

    order This paper mainly studies the groupby operation of the flick table Table.groupBy flink-table_2.11-1.7.0-sources.jar!/org/apache/flink/table/api/table.scala class Table( private[flink] val tableEnv: TableEnvironment, private[flink] val logicalPlan: LogicalNode) { //…… def groupBy(fields: String): GroupedTable = { val fieldsExpr = ExpressionParser.parseExpressionList(fields) groupBy(fieldsExpr: _*) } def groupBy(fields: Expression*): GroupedTable = { new GroupedTable(this, fields) } //…… } The groupby operation of […]

  • One text concatenation http / [0.9 | 1.0 | 1.1 | 2 | 3]

    Time:2021-7-27

    After the birth of the world wide web in 1989, HTTP quickly became the dominant application layer protocol in the world. Today, almost any scenario uses the HTTP protocol more or less. In the history of more than 30 years, HTTP protocol itself has made great development. At the same time, some major changes are […]

  • Restricted linear list queue (sequential storage and chained storage)

    Time:2021-5-4

    1. Queue overview 1.1 queue definition A queue is a linear table that only allows insertion at one end and deletion at the other.A queue is a first in first out linear tableThe end that can be inserted is called the end of the team, and the end that can be deleted is called the […]

  • Array implementation of circular queue Java

    Time:2021-4-16

    The characteristic of using array to realize circular queue is high efficiency. It can quickly judge whether the queue is full or empty; Fast access to data. Because it is simple and efficient, ring queue is implemented even in hardware. Ring queue is widely used in network data sending and receiving, and data exchange between […]

  • Algorithm several double pointer problems of leetcode

    Time:2021-2-16

    1. Search insertion position https://leetcode-cn.com/problems/search-insert-position/ class Solution { public int searchInsert(int[] nums, int target) { int left=0,right=nums.length-1; while(left<=right){ int mid=(left+right)/2; if(nums[mid]<target){ left=mid+1; }else if(nums[mid]>target){ right=mid-1; }else{ return mid; } } return left; } } 2. Search for 2D matrix https://leetcode-cn.com/problems/search-a-2d-matrix/ public boolean searchMatrix(int[][] matrix, int target) { if(matrix.length == 0) return false; int row = […]

  • Circular queue (Java)

    Time:2021-2-12

    Queue It’s a linear structure You can only add elements from the end of the team, which is called enqueue; Elements can only be taken from the head of the team, which is called dequeue; First in first out feature(FIFO-first in first out): the element inserted first comes out firstBack: the index of the end […]

  • Boost circular queue_ buffer

    Time:2021-1-8

    The ring queue of boost library is flexible. It supports forward or backward insertion, deletion of the first or last element of the queue. Paste code only: #include #include #include #include using namespace std; class C_usrdata{ public: int x; int y; }; void DispCirBuff(boost::circular_buffer &oCircularBuffer){ for(boost::circular_buffer::iterator it=oCircularBuffer.begin(); it!=oCircularBuffer.end(); it++){ cout << (*it).x << ” ” […]

  • Restricted linear table queue (sequential storage and chain storage)

    Time:2020-10-17

    1. Queue overview 1.1 queue definition A queue is a linear table that allows insertion at one end and deletion at the other.A queue is a first in, first out linear tableThe end that allows insertion is called the tail of the queue, and the end that allows deletion is called the header.Like stack, queue […]