mongolian sword

"Sword refers to offer" prints a binary tree from top down, and the sword refers to offer rebuilding a binary tree. [Disclaimer: All Rights Reserved. indicate the source for reprinting. Do not use it for commercial purposes. Contact mailbox: libin493073668@sina.com] Question link: http://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701? Rp = 2 ru =/ta/coding-interviews qru =/ta/coding-interview

String arrangement of "Sword refers to offer" and "Sword refers to offer" [Disclaimer: All Rights Reserved. indicate the source for reprinting. Do not use it for commercial purposes. Contact mailbox: libin493073668@sina.com] Question link: http://www.nowcoder.com/practice/fe6b651b66ae47d7acce78ffdd9a96c7? Rp = 2 ru =/ta/coding-interviews qru =/ta/coding-interviews/question-ranking DescriptionEnter a str

Sword refers to Offer interview question 27 (Java edition): Binary Search Tree and two-way linked list, sword refers to offer Question: enter a binary search tree and convert it into a sorted two-way linked list. It is required that a new node cannot be created. You can only adjust the point of the node pointer in the tree. For example, in the binary search tree, the two-way linked list after the output con

Sword refers to offer interview question 14 (Java edition): Adjust the array order so that the odd number is in front of the even number, the sword refers to offer Question: enter an integer array and implement a function to adjust the order of numbers in the array so that all odd numbers are in the first half of the array, and all even numbers are in the second half of the array. 1. Basic implementation: I

Sword refers to offer2 -- search in two-dimensional array (used in array), and sword refers to offer2 -- Question: In a two-dimensional array, each row is sorted in ascending order from left to right, and each column is sorted in ascending order from top to bottom. Complete a function, input a two-dimensional array and an integer to determine whether the array contains the integer. Ideas: Because it is

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 offer interview question 11, and sword refers to offer question 11 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. #include Copyright Disclaimer: This article is an original article by the blogger and cannot be reproduced without the permission of the

[Sword refers to Offer learning] [interview question 47: addition without subtraction, multiplication, division], sword refers to offer Question: To write a function and calculate the sum of two integers, The +,-, ×, and limit operators must not be used in the function.Solutions The binary value of 5 is 101, and the binary value of 17 is 10001. We still try to divide the calculation into three steps: the fi

[Sword refers to offer] Question 3: Two-dimensional array search; sword refers to offer Package javaTrain; public class offer3 {public static void main (String args []) {int [] [] a = {0, 1, 2, 3}, {1, 3, 4 }, {2, 3, 4, 5}, {6, 7, 8, 9}; System. out. println (find (a, 10);} public static boolean find (int [] [] a, int num) {if (a = null) return false; int n =. length; int m = a [0]. length; int I = 0; int

[Sword refers to Offer learning] [interview question 31: the largest sum of consecutive sub-arrays], sword refers to offerQuestion: enter an integer array with a positive or negative number in the array. One or more consecutive integers in the array form a sub-array. Returns the maximum value of the sum of all sub-arrays. The time complexity is O (n ). Example: For example, the input array is {1,-2, 3, 10,-

[Sword refers to Offer learning] [interview question 36: Reverse Order pairs in the array], sword refers to offer Question: two numbers in the array. If the first number is greater than the next number, the two numbers form a reverse order. Enter an array to find the total number of reverse pairs in this array.Example Analysis For example, in the array {7, 5, 6, 4, there are five Reverse Order pairs, respec

[Sword refers to Offer learning] [interview question 41: two numbers vs for s and a continuous positive number sequence for s], sword refers to offer Question 1: enter an incremental sorting array and a number s to search for two numbers in the array. The sum of them is exactly s. If the sum of multiple pairs of numbers is equal to s, output any pair.Example For example, input arrays {1, 2, 4, 7, 11, 15} an

[Sword refers to Offer learning] [interview question 3: Search in two-dimensional array], sword refers to offer Question: In a two-dimensional array, each row is sorted in ascending order from left to right, and each column is sorted in ascending order from top to bottom. Complete a function, input a two-dimensional array and an integer to determine whether the array contains the integer. Public class Test

[Sword refers to Offer learning] [interview question 39: depth of Binary Tree], sword refers to offer Question 1: Enter the root node of a binary tree to find the depth of the tree. A tree path is formed from the root node to the leaf node. The longest path length is the depth of the tree.Binary Tree node Definition private static class BinaryTreeNode { int val; BinaryTreeNode left; BinaryTreeNode

[Sword refers to offer] interview question 43: points of n dice, and the sword refers to offer The first idea is that the number of points for each dice ranges from minimum to maximum. Suppose it is 1-6, then all the dice start from minimum 1. We assume a sort from left to right, the lowest value on the right, and the index starts from the lowest value. def setTo1(dices, start, end):for i in range(start, e

[Sword refers to Offer learning] [interview question 59: symmetric Binary Tree], sword refers to offer Question: implement a function to determine whether a binary tree is symmetric. If a binary tree is the same as its image, it is symmetric.Solutions We usually have three different binary tree traversal algorithms, namely pre-order traversal, middle-order traversal, and post-order traversal. Among the thre

[Sword refers to Offer learning] [interview question 52: Building a product array], sword refers to offer Question: given an array A [0, 1 ,..., N-1], build an array B ,..., N-1], where B [I] = A [0] × A [1] ×... × A [I-1] × A [I + 1] ×... * A [n-1], division is not allowed.Solutions Example: A [] = {1, 2, 3} evaluate B []B [0] = A [1] × A [2] = 2 × 3 = 6B [1] = A [0] × A [2] = 1 × 3 = 3B [2] = A [0] × A [1

[Sword refers to Offer learning] [interview question 54: a string that represents a value], sword refers to offer Question: Use a function to determine whether a string represents a number (including an integer and a decimal number ).Example For example, strings "+ 100", "5e2", "-123", "3.1416", and "-1E-16" all represent numerical values, but "12e", "1a3. 14 "," 1.2.3 "," +-5 "and" 12e + 5.4 "are none.　　 S

[Sword refers to Offer] 2. abnormal jump steps, sword refers to offer Question A frog can jump to level 1 or Level 2 at a time ...... It can also jump to n levels. Find the total number of hops that the frog jumps to an n-level step. Ideas Use Fib (n) to represent the number of hops on the n-step. Set Fib (0) to 1; When n = 1, there is only one hop method, that is, level 1 hop, that is, Fib (1) = 1; When n