mongolian sword

[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

[Sword refers to Offer learning] [interview 19: Binary Tree image], sword refers to offerQuestion: complete a function and enter a binary tree. The function outputs its image. Binary Tree node definition: /*** Tree node of the binary tree */public static class BinaryTreeNode {int value; BinaryTreeNode left; BinaryTreeNode right ;}Solution: We previously traverse every node of the tree in order. If the node

[Sword refers to Offer learning] [interview question 37: the first public node of two linked lists], sword refers to offerQuestion: enter two linked lists to find their first public node.Linked List node Definition /*** Linked list node class */private static class ListNode {int val; ListNode next; public ListNode () {} public ListNode (int val) {this. val = val ;}@ Override public String toString () {retur

[Sword refers to Offer learning] [interview question 51: Repeated numbers in the array], sword refers to offer Question: All numbers in an array with a length of n are in the range of 0 to n-1. Some numbers in the array are repeated, but I do not know how many numbers are repeated or how many times each number is repeated. Find any repeated number in the array.Example For example, if the input length is 7 i

Sword refers to Offer interview question 10 (Java edition): number of 1 in binary, and sword refers to offer Question: Please implement a function, input an integer, and output this number in binary format to represent the number of 1. For example, if 9 is expressed as binary 1001, two digits are 1. Therefore, if 9 is input, this function outputs 2. 1. solutions that may cause an endless loop This is a basi

[Sword refers to Offer] The rectangle is covered, and the sword refers to the offer rectangle.Problem description We can use a 2*1 small rectangle to overwrite a larger rectangle either horizontally or vertically.I would like to ask you to use n small rectangles of 2*1 to overwrite a large rectangle of 2 * n without overlap,How many methods are there in total?Solutions N = 1-only one rectangle is placed h

Sword refers to the motion range of the offer robot, and sword refers to the offer Robot [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/6e5207314b5241fb83f2329e89fdecc8? Rp = 4 ru =/ta/coding-interviews qru =/ta/coding-interviews/question-ranking Descrip

"Sword refers to offer" symmetric binary tree, "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/ff05d44dfdb04e1d83bdbdab320efbcb? Rp = 3 ru =/ta/coding-interviews qru =/ta/coding-interviews/question-ranking DescriptionImplement a fu

"Sword refers to offer": 1 + 2 + 3 +... + n, "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/7a0da8fc483247ff8800059e12d7caf1? Rp = 3 ru =/ta/coding-interviews qru =/ta/coding-interviews/question-ranking DescriptionEvaluate 1 + 2 +

The "Sword refers to offer" prints a binary tree in the alphabetic order. 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/91b69814117f4e8097390d107d2efbe0? Rp = 3 ru =/ta/coding-interviews qru =/ta/coding

"Sword refers to offer", "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/6aa9e04fc3794f68acf8778237ba065b? Rp = 2 ru =/ta/coding-interviews qru =/ta/coding-interviews/question-ranking DescriptionThe Number that contains only factor

The image of the Binary Tree "Sword refers to offer" and the Binary Tree "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/564f4c26aa584921bc75623e48ca3011? Rp = 1 ru =/ta/coding-interviews qru =/ta/coding-interviews/question-ranking

Stack where the sword refers to offer contains min functions and the 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/4c776177d2c04c2494f2555c9fcc1e49? Rp = 1 ru =/ta/coding-interviews qru =/ta/coding-interviews/question-ranking

"Sword refers to offer" sorts the array into the smallest number, and "Sword refers to offer" Arrays [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/8fecd3f8ba334add803bf2a06af1b993? Rp = 2 ru =/ta/coding-interviews qru =/ta/coding-interviews/question-rank

Sword refers to offer, balance Binary Tree, 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/8b3b95850edb4115918ecebdf1b4d222? Rp = 2 ru =/ta/coding-interviews qru =/ta/coding-interviews/question-ranking DescriptionEnter a binary