mongolian sword

Young's matrix: each row increments from left to right, and each column increments from top to bottom.Title: Enter a young matrix and an integer to determine if the number appears in the Young's matrix.Analysis: There are three different methods of time complexity.The first: traversing the entire two-dimensional array, this method is the least efficient.The second: Because the young matrix each row is incremented, is ordered, we can first determine whether the integer is greater than or equal to

Title Descriptionoperates a given two-fork tree and transforms it into a mirror of the source binary tree.Input Description:Image definition of binary tree: source binary tree 8 /6 x / \ 5 7 9 Mirror binary tree 8 / 6 /\ / 9 7 5Code Listing 1:recursive method, the memory is easy to explode when the recursion depth is largeCode Listing 2:traversal from the root node, using stacks to implementThe mirror of the binary tree of the offer (34)

Idea: In the case of not changing the structure of the linked list, to scan the chain list from start to finish, and then from the end of the output, this is a "advanced after-out" thinking. The most intuitive idea is to use the stack to do it.vectorint> Printlistfromtailtohead (structlistnode*head) {Vectorint>result; Stackint>output; while(head) {Output.push (head)-val); Head=head->Next; } while(!Output.empty ()) { intnum=Output.top (); Result.push_back (num);

voidReplacespace (Char*STR,intlength) { if(str==null| | length0) return; intoriginlen=0; intnewlen=0; intSpace=0; while(str[originlen]!=' /') { if(str[originlen]==' ') Space++; Originlen++; } Originlen++; Newlen=originlen+2*space; if(originlen==1|| space==0|| Newlen>length)return; Char*p1,*P2; P1=str[originlen-1]; P2=str[newlen-1]; for(intI=0; i) { if(*p1!=' ') { *p2=*P1; P1--; P2--; } Else {

Title DescriptionHow can I get the median in a data stream? If you read an odd number of values from the data stream, the median is the value in the middle after all the values have been sorted. If you read an even number of values from the data stream, the median is the average of the median two numbers after all the values are sorted.Code:Import java.util.*;public class Solution {Arraylistpublic void Insert (Integer num) {Al.add (num);Collections.sort (AL);}Public Double Getmedian () {int mid

Title DescriptionPlease design a function to determine if there is a path in a matrix that contains all characters of a string. The path can start from any grid in the matrix, and each step can move to the left, right, up, and down a grid in the matrix. If a path passes through a lattice in the matrix, the path can no longer enter the grid. For example a B c e s f C s a D-e matrix contains a path to the string "bcced", but the matrix does not contain a "ABCB" path, because the first character B

Title DescriptionPlease implement a function to match the include '. ' And the regular expression of ' * '. The characters in the pattern '. ' Represents any character, and ' * ' means that the character preceding it can appear any time (0 times). In the subject, the match refers to all characters of the string that match the entire pattern. For example, the string "AAA" matches the pattern "a.a" and "ab*ac*a", but does not match "aa.a" and "Ab*a"Code:The regular expression match of the

the values to be compared, pattern ignores the value of the * before, moves back two bit to continue the comparison, the STR value is unchanged the Else{ + returnMatchcore (str,i,length1,pattern,j+2, length2); - } $ } $ - //1 2 The current character matches or matches '. ' Both are shifted right one continues to compare; - if(I)){ the returnMatchcore (str,i+1,length1,pattern,j+1, length2); - }Wuyi

Title DescriptionEach node of the two-fork tree is printed from top to bottom, and the same-level node prints from left to right.Thinking Analysis: Use two list, a storage node, a storage value. The root node is added to the list first, then the elements in the list are traversed, the left and right nodes of the element are accessed, and the left and right child nodes are added to the listThe sword refers to the offer (37) from the top down to print t

lowest bit cleared, so in turn, until the highest bit becomes 10, then the printing is finished. Here are two things to watch out for!!! 1, carry: In addition to the highest bit without carry, the rest of the bits are likely to produce a carry, so in writing carry should pay attention to its applicability. 2, at the time of printing, assuming that the size of the array of 3 is 098, then print out is 098, this does not conform to our usual logic, so we have to implement a printing function, let

Before installing RABBITMQ, you need to install Erlang first, as follows:Yum install ncurses-develwget Http://www.erlang.org/download/otp_src_17.1.tar.gztar zxvf otp_src_17.1.tar.gzAfter unpacking the tar.gz package, compile and installCd The specific installation process under CentOS 7 can be found in the following: http://www.rabbitmq.com/install-rpm.htmlWget-c http://www.rabbitmq.com/releases/rabbitmq-server/v3.6.1/rabbitmq-server-3.6.1-1.noarch.rpmrpm--import Https://www.rabbitmq.com/rabbi

split an array Solution two run time: 38ms occupied memory: 654k ImportJava.util.Arrays; Public class solution { Public Boolean Verifysquenceofbst(int[] sequence) {intlen = sequence.length;if(sequence==NULL|| len==0)return false;intI=0; for(; i1; i++) {//Search for the dividing point of left and right sub-trees if(sequence[i]>sequence[len-1]) Break; } for(intj=i;j1; j + +) {if(sequence[j]1])return false; }Booleanleft=true;///left subtree flag, true by default

Two stacks for queue title descriptionImplement a queue with two stacks to complete the push and pop operations of the queue. The elements in the queue are of type int.Ideas The order of a stack is "last in, first out", and then the order is reversed by a stack to satisfy the queue's "FIFO" rule. With two stack implementations, STACK1 is responsible for entering the queue, and then from the Stack2 stack out of the queue, if the Stack2 is empty, and then pop from Stack1 to Stack2

; +small++; - if(sum==R) { the /*for (int i=small;i * Numlist.add (i); $ } */ Panax Notoginseng Add (small,big,numlist); - } the } + //at this point sum>s jumps out of the while loop and goes to the following steps A //Sum>s the if(Numlist.size () >0) + List.add (numlist); -big++; $sum+=Big; $ - } - the re

Delete Duplicate node title description in linked listIn a sorted list, there are duplicate nodes, delete the duplicate nodes in the linked list, duplicate nodes are not retained, and return the chain header pointers. For example, the list 1->2->3->3->4->4->5 is treated as 1->2->5Ideas Requires two pointers, one pointing to the previous node Prenode, the other pointing to the current node, and node moving backwards if it encounters equal nodes, Prenode, Save Node.val convenient to the b

successfully passed the official two test cases, but later I found that my two flags array in some input situations will overflow, are tears, corrected Java source code as follows:ImportJava.util.Scanner; Public classMain { Public Static voidMain (string[] args) {//TODO auto-generated Method StubScanner Scan=NewScanner (system.in); while(Scan.hasnext ()) {introw =Scan.nextint (); intCol =Scan.nextint (); int[] Matrix =New int[Row][col]; for(inti = 0; i ) { for(intj

Left Rotation string Title descriptionIn assembly language, there is a shift instruction called the cyclic left shift (ROL), now there is a simple task, is to use a string to simulate the operation of the command results. For a given character sequence s, you turn the output of the sequence to the left of the K-bit after it is moved. For example, the character sequence s= "Abcxyzdef", which requires the output loop to move left 3 bits after the result, i.e. "XYZDEFABC". Isn't it simple? OK, Fix

"title" Beg 1+2+3+...+n,* Requires no use of multiplication, for, while, if, else, switch, case and other keywords and conditional judgment statement (A? B:C).1 PackageCom.exe10.offer;2 3 /**4 * "title" asks 1+2+3+...+n,5 * requires no use of multiplication, for, while, if, else, switch, case and other keywords and conditional judgment statement (A? B:C). 6 * @authorWGS7 *8 */9 Public classSumofn {Ten intResult=0; One A Public BooleanCalcintN) { -result+=N; - returnN!=

A string that represents the value of the title descriptionImplement a function to determine whether a string represents a numeric value (including integers and decimals). For example, the string "+100", "5e2", "123", "3.1416" and " -1E-16" all represent numeric values. But "12e", "1a3.14", "1.2.3", "+-5" and "12e+4.3" are not.Ideas The structure of the value is ' +/-' + ' integer ' + '. ' + ' integer ' + ' e/e ' + ' +/-' + ' integer ' Match by structure, if statement can match only

The first non-repeating character in a character stream is described in the titleImplement a function to find the first character in a character stream that appears only once. For example, when you read only the first two characters "go" from a character stream, the first character that appears only once is "G". When the first six characters "Google" are read from the stream, the character that appears only once is "L".Enter a description Returns the # character if the current character