huawei e3276

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

Huawei Computer Testing Questions (convert digital string to binary-java), Huawei-java /** Title: convert a numeric string to a binary string Description: enter an integer to convert each integer to a binary number. If the last and third bits are "0", the output value is "0". If it is "1 ", output "1 ". Question category: bitwise operation Difficulty: elementary Score: 60 Run Time Limit: 10 Sec Memory limit

Huawei Computer Testing Questions (expression calculation-java), Huawei-java PS: Self-written, self-tested OK for your reference. /** Enter an expression (3*8 + 7-2) with no parentheses to output the result.*/ /* This program does not consider fault tolerance Processing for the moment */ 1 import java. util. iterator; 2 3 public class Calculator {4 5/* For example, in expression 3*8 + 7-2, dataNum = 4, opNu

and select Restart system now]Friendly reminder: The first boot may be slow and patient.Method 2: upgrade the SD card for Huawei P71. First, put the downloaded official Flash Drive File and UPDATE. APP to the SD card dload folder. If this folder is not available, create it. Then go to the phone settings page and find the phone upgrade option, as shown in the following figure:2. Continue to select system software updates, and then the current version

Huawei P7 Mobile phone how to upgrade The first step, turn on the mobile "settings"-"All set"-click "Mobile Upgrade" below, and then click "Software System update." Second step, click on "Online Upgrade", select "Download and install". The third step, finally waiting for him to download after the "System Software Update" prompts, click "OK." Then wait for the phone to automatically install complet

VLAN 6#WLAN \ Configure WMM templates, RF templates (default) and bind to each otherWmm-profile name WLANRadio-profilename WLANWmm-profile name WLAN#Security-profile name WLAN \ Configure security templates, WEP authentication, shared keysSecurity-profile WEPWEP Authentication-method Share-keyWEP key wep-40 pass-phrase 0 cipher 12345#Traffic-profile name \ Configure traffic templates#Service-set name WLAN \ Configure data forwarding mode for tunnels and service templatesSSID WLANWlan-ess 0Servi

2015 Huawei trial-print the number of different characters in the string, 2015 HuaweiDescription:Find the number of different characters in the string.Question type: StringDifficulty: elementaryRunning time limit: UnlimitedMemory limit: UnlimitedStage: Pre-Employment exercisesInput:Enter a string, '\ 0' as the string Terminator.Output:Number of different characters in the output string.Sample input:122345Sample output: 5 The Code is as follows: