e sword commentaries

Take notes on solving the problem of "Sword refers to offer" and "Sword refers to offer"Notes on solving the problem of sword pointing to offer I have a total of 50 questions about "Sword finger offer". I have spent time using C ++ over the past two weeks, I would like to make some clever methods, difficulties in writi

Sword refers to the Java Implementation of offer programming questions -- interview question 6 re-constructs a binary tree, and sword refers to offer Question: Enter the result of the forward and middle traversal of a binary tree. Create a New Binary Tree. Assume that the input results do not contain repeated numbers.For example, if the input preorder traversal sequence {,} and the middle order traversal se

Oracle Optimization-double-edged sword and oracle optimization double-edged sword Oracle optimization is a double-edged sword. Pay special attention to the use of this sword:OLTP or OLAP Optimization 1: Index During DML operations, indexes must be maintained. If a large number of DML operations are performed, check whether I/O is too old? Index advantages: in man

[Sword refers to Offer learning] [interview question 67: robot motion range], sword refers to offer Question: There is a square in n columns of m rows on the ground. A robot moves from a grid of coordinates (0, 0). Each time it moves a grid to the left, right, top, or bottom, however, you cannot enter a grid where the sum of the numbers of the row and column coordinates is greater than k.Example Analysis Fo

Sword refers to Java Implementation of offer programming questions-the integer power of the value of interview question 11, and sword refers to offer Question: Implement the double power (double base, int exponent) function to calculate the power of base's exponent. Do not use library functions, and do not need to consider large numbers. Solution: the most common way to realize the n power of a value is to

Sword refers to Java Implementation of offer programming questions -- interview question 13 deletes linked list nodes in O (1) time, and sword refers to offer Question: given a one-way linked list head pointer and a node pointer, define a function to delete the node at O (1) time. Given a one-way linked list, the time complexity of normal Chain List deletion is the time complexity of searching the linked li

The sword refers to the search in the offer_02 _ two-dimensional array and the sword refers to offer_02 #include Search for an integer in a two-dimensional array. If it is found, the Element and Its Array subscript are displayed. If it is not found, a prompt is displayed. Er, to solve this problem, traverse the array to find the ordered array. Use the 2-point search method.How to find a two-dimensional ar

[Sword refers to Offer learning] [interview question 53: Regular Expression matching], sword refers to offer Question: implement a function to match regular expressions containing '.' and. The character '.' In the mode indicates any character, while '*' indicates that the character before it can appear any time (including 0 times ). In this question, matching means that all characters in the string match th

The sword refers to the source code of the offer series-string arrangement, and the sword refers to the offer Question 1369: String sorting time limit: 1 second memory limit: 32 MB special question: No submitted: 2432 solution: 609 question Description: enter a string, print all characters in the string in Lexicographic Order. For example, if abc is input, all the strings abc, acb, bac, bca, cab, and CBA th

[Sword refers to Offer learning] [interview question 28: String arrangement], sword refers to offerQuestion: enter a string to print all the characters in the string. For example, input the string abc. Print all strings abc, acb, bac, bca, cab, and CBA that can be arranged by characters a, B, and c. Solution: Consider a string as composed of two parts: the first part is its first character, and the second p

[Sword refers to Offer learning] [interview question 60: print the binary tree out multiple rows], sword refers to offer Question: print a binary tree from top to bottom, print the nodes on the same layer in the order from left to right, and print a row on each layer.Solutions Use a queue to save the nodes to be printed. To print each row of a binary tree to a single row, we need two variables: one variable

[Sword refers to Offer learning] [interview question 61: print a binary tree in the alphabetic order], sword refers to offer Question: Please implement a function to print a binary tree in the font order, that is, the first line is printed from left to right, and the second layer is printed from right to left, that is, the first row is printed from left to right, the second row is printed from right to left

Sword refers to offer interview question 26-copy of complex linked list, sword refers to offer struct ComplexListNode { int m_nValue; ComplexListNode* m_pNext; ComplexListNode* m_pSibling; }; For a complex linked list with five nodes, the solid line indicates the point of the m_pNext pointer, And the dotted line indicates the point of the m_pSibling pointer. So

Sword refers to offer interview questions 19-binary tree image, sword refers to offer Question: Complete a function, input a binary tree, and the function outputs its image. Basic Idea: Each node in the tree is traversed in the previous order. If the node to be traversed has a subnode, it will exchange its two subnodes. After switching all the left and right subnodes of non-leaf nodes, the tree image i

[Sword refers to Offer learning] [interview question 63: k node of the Binary Search Tree], sword refers to offer Question: Given a binary search tree, locate the k-th node in the tree.Solutions If a binary search tree is traversed sequentially, the values of the traversal sequence are sorted progressively. You only need to traverse a binary search tree by using the Middle-order traversal algorithm, and it