huawei e3372

1. If you want to make an appointment with Huawei products in advance, you only need to go to [Huawei mall]. If you do not know the address, search Baidu.2. At the Huawei Mall, click this button to go to the Ascend P7 reservation page.3. Then, we just need to enter your mobile phone number and verification code in the interface, and then click [reserve now].4. If

Huawei trial-search for the number of substrings and Huawei for the number of substrings Enter a string to determine the number of substrings. Input: asdg ds dga Output: 3 # Include

Huawei trial-subtraction of large numbers, Huawei large numbers Question: subtraction of large numbers Enter a positive integer of two strings. The first line is the subtrahend, the second line is the subtrahend, and the result of the first line minus the second line is output. Note: 1. Both integers are positive integers. The subtrahend are greater than the subtrahend. Example: Input: 1000000000000001 1

Huawei trial-outputs a single digit and a single digit, While Huawei outputs a single digit Two solutions: 1. Add one by one # Include 2. Convert to string Addition # Include

Huawei test-Child string separation and Huawei string SeparationDescription:Input any string sequence through the keyboard. The string may contain multiple substrings separated by spaces. Compile a program to automatically separate the substrings and separate them with commas (,). At the end, add a comma (,) and store the substrings.If "abc def gh I d" is input, the result will be abc, def, gh, I, d,Require

Huawei trial-difference sorting, Huawei difference sorting Sorts the integer array by the difference value from the specified integer and returns the result in ascending order of the difference value. Implementation Method: Public staticint [] calcTimes (int [] num, int value ); [Input] num: an integer array; Integer specified by value [Return] returns an integer array in ascending order, sorted by the di

Huawei machine trial-same sub-string, Huawei Machine Enter a string to check whether the string contains the same substring (the string length is greater than 1). The value is output 1, no, and output 0. For example, 12312 contains two 12 s, so output 1; 23456 does not have the same subsequence, and output 0.Input: 12312 Output: 1 # Include Test data: 12312 Test results:

Huawei trial-word count, Huawei word count Enter an article, and output the words with the highest frequency and the secondary frequency (all in lower case, separated by commas ). Only the space, comma, and period delimiters are displayed in the article. Regardless of the frequency. Case Insensitive. Input: I am a student. I come from XiDian, I love XiDian. Output: I, xidian #include

Huawei machine trial-string de-sequencing, Huawei machine string sorting Enter a string, remove the repeated characters, and sort the remaining strings. # Include Test data: Dfsfsf3345s Test results:

Huawei machine trial-Sort Huawei machines by bit and by bit # Include

Huawei trial-the product of the single digit and the reverse order of the numbers, and the reverse order of Huawei # Include

Huawei trial-output number containing "23", Huawei 23 Enter a row of numbers: 123 423 5645 875 186523In the input second line: 23Output and sort the number containing "23" in the second row in the first row Result: 123 423 186523 /* Sort and traverse each number sequentially to see if 23 */# include Test data: 123 423 5645 875 186523 23 Test results:

Huawei trial-replace letters in strings with Huawei strings Function Description: replace all the letters in a string with the next letter. If the last character is z or Z, replace it with A or. * Input: aBxyZ * Output: bCyzA # Include

Huawei trial-converts the initial character string to uppercase, and Huawei capitalExample:Input: this is a book Return Value: This Is A Book # Include

Huawei trial-sorting by integer array (string input and output) and Huawei Input and Output # Include

Question about the number of matching brackets in Huawei OJ training, Huawei oj The questions are as follows: Parentheses matching Input n parentheses and output n parentheses that can be combined. For example -- Only () is input; When the input is 2, there are two types: () and; When 3 is input, there are (), () and ((())), five types. There are 14 input values .. And so on. I think of stupid methods, an

Huawei recruitment testing 7: an array of input [], Huawei inputHuawei recruitment testing 7: an array of input [] Question: Give an array intput []If the array length n is an odd number, place the largest element in the array in the middle of the output [] array. If the array length n is an even number, place the largest element in the array to the right of the two locations in the middle of the output []

Huawei OJ training-simple bank numbering system, Huawei oj The topic of Level 5 is an intermediate question and an advanced question. The intermediate question is relatively simple and has been completed in half an hour. The questions are as follows: Implement a simple bank Numbering System Example of getting a get number: "get" or "get vip" Call example: "call" Example of deleting a delete number: "d

2015 Huawei server test-the ending number of the high power, and the ending number of the 2015 Huawei power Description: The last three digits (M, N are all greater than 10) of the N power of M ). Interface Description Prototype: Int GetLast3DigitsOfMN (int M, int N ); Input parameters: Int M: M> 10 Int N: N> 10 Return Value: The last three digits of M's n power Solution: Idea 1: first cal

2015 Huawei trial-input an integer array and a sorting ID to sort the elements in ascending or descending order. 2015 Huawei Interface Description Prototype: Void sortIntegerArray (Integer [] pIntegerArray, int iSortFlag ); Input parameters: Integer [] pIntegerArray: Integer Array Int iSortFlag: Sorting identifier: 0 indicates ascending, 1 indicates descending Output parameters: None Return Value: Void Thi