Programmer Group

The previous lectures introduced Ruby's basic data objects "string" and "value". Ruby has more than these two data objects. The structure of data objects involved in most Ruby programs is much more complex. This lecture summarizes arrays, hashes, and regular expressions. Don't worry, the knowledge here will be briefly explai ...

preface Hello everyone! I haven't seen you for a long time. The forever is here again. I've been very busy recently, so I haven't updated it for a long time. Last time I introduced the function related knowledge, and then this time we'll have a little episode to show you the tic tac toe game! However, due to the tight time recently, I'll ...

Huawei 04.16 reply to three algorithm questions 1. Invert the substring between each pair of parentheses Give a string s (containing only lowercase letters and parentheses). Please reverse each pair of matching strings in parentheses layer by layer from inside to outside of parentheses, and return the final result. Note that your results sh ...

##0. Preface Recently, when doing algorithm transplantation, I found that I had forgotten a lot about c + +, so I planned to pick it up again. I feel shallow on paper. I never know that I have to practice it It has always been the principle of my study and work. I prefer hands-on. So I knocked the basic knowledge of c + + line by line, no matte ...

Title Description: Given a source string and a target string, the following operations can be performed on the source string: Insert a character at any position; Replace any character; Delete any character. Write a program to return the minimum number of operations, so that the source string is equal to the target string after the above operat ...

Basic introduction to heap Heap is a special kind of data structure in computer science. Heap is usually an array object that can be regarded as a complete binary tree. All its elements are stored in a one-dimensional array in the order of a complete binary tree, and the value of any parent node must be less than or equal to (greater tha ...

Time complexity: the time complexity of an algorithm is a function that qualitatively describes the running time of the algorithm. This is a function representing the length of the string of the input value of the algorithm. The time complexity is usually expressed by large O sign, excluding the low-order term and first term coefficient of this ...

Our ultimate goal is to be lazy. Working together is to see you work hard, and I am lazy to enjoy. Therefore, in order to be lazy, frame programming is inevitable. In my blog in the future, I hope everyone is frame programming. Those who are irregular should be serious and diligent. We are too lazy to be worthy of you. joy:, remember that we ar ...

sort 1. Concept of sorting Sorting: the so-called sorting is the operation of arranging a string of records incrementally or decrementally according to the size of one or some keywords. Stability: if there are multiple records with the same keyword in the record sequence to be sorted, the relative order of these records remains unchanged aft ...

This paper summarizes some common simple problem-solving methods encountered in the process of brushing questions: Array is a kind of linear table in data structure. It is often displayed in the form of integer array and string in algorithm problems. In fact, the array contains more data types. This paragraph mainly explains the solutions ...