100 quiz questions

Questions about new users learning php (closed at 100% on weekends) Question 1: interface problems My understanding: some specifications of the interface definition, the classes that implement the interface must comply with these specifications. How can I make other companies call interfaces in the project? When do I use interfaces? Reply to discussion (solution) The interface defines explicit incoming

LINUX cainiao... The teacher posted 100 questions, but not many. Can you help me... -- Linux general technology-Linux technology and application information. For details, refer to the following section. I have been studying LINUX for two days. I still have a big question... Let's take a look... There are two files, "a.txt" (including 4 fields: name, age, gender and country) and "B .txt" (including 3 fields:

[Programmer interview question selection 100 questions] 2. Design a stack containing min functions, programmer min[Question] Define the data structure of the stack. Add a min function to obtain the minimum element of the stack. The time complexity of the min, push, and pop functions is O (1 ).[Analysis] This is an interview question from google last year. When I see this question, the first reaction is to

#-*-Coding:utf-8-*-# title: There are 1, 2, 3, 4 numbers, can make up how many different and no repetition of the number of three digits? How much are they?# program Analysis: Can be filled in hundreds, 10 digits, single digit numbers are 1, 2, 3, 4. Make all the permutations and then remove the permutations that do not meet the criteria.# program Source code:def permutation (nums):For x in Nums:For y in Nums:For z in Nums:If Len (set ({x, y, z}) = = 3:print ' {}{}{} '. Format (x, Y, z)if __name

"Program 15"Title: Use the nesting of conditional operators to complete this problem: the students of the study score >=90 with a, 60-89 points between the use of B, 60 points below the C expression.1. Program Analysis: (a>b)? A:b This is a basic example of a conditional operator.2. Program Source code:1 ImportJava.util.Scanner;2 3 /*this article transferred from blog: www.cnblogs.com/java-1004 "Program 15"5 title: Use the nesting of conditional operators to complete this problem: the students o

"Program 17"Title: Enter a line of characters, respectively, the number of English letters, spaces, numbers and other characters.1. Program Analysis: Using the while statement, the condition for the input character is not ' \ n '.2. Program Source code:1 ImportJava.util.Scanner;2 3 /* This article goes from the blog: www.cnblogs.com/java-1004 "program 17"5 Title: Enter a line of characters, respectively, the number of English letters, spaces, numbers and other characters. 6 program analysis: con

quotient of K, as a new positive integer n, repeat the first step. Ten (4) If n cannot be divisible by K, the first step is repeated with k+1 as the value of K. One */ A - Public classJAVA14 { - the Public Static voidMain (string[] args) { -System.out.print ("Please enter a positive integer:"); -Scanner Scanner =NewScanner (system.in); - intNumber =scanner.nextint (); + scanner.close (); - intnum =Number ; +System.out.print (num + "="); A BooleanA =true; at

"Program 5"Title: Enter three integers x, y, Z, please put these three numbers from small to large output.1. Procedure analysis: We find a way to put the smallest number on the X, first compare x with Y, if x>y the value of x and Y to Exchange, and then with X and Z to compare, if X>z will be x and Z of the value of the exchange, this can make x minimum.2. Program Source code:1 ImportJava.util.Scanner;2 3 /*this article transferred from blog: www.cnblogs.com/java-1004 "program 5"5 title: Enter t

The sword refers to the sum of two digits of S.The sum of the points of offer and the successive positive sequence of sExtension (1): Enter an array to infer that the array is not present in three digits I, J, K, satisfy I+j+k equals 0.Extension (2): Suppose the input array is not sorted, but know the range of the numbers inside, other conditions are unchanged, how to find these two numbers in O (n) time? The basic idea is to first use the hash table to achieve O (n) sorting (please refer to the

Original title Link: http://www.runoob.com/python/python-exercise-example28.htmlTitle : 5 people sit together and ask how old is the five? He said he was 2 years older than the 4th one. Asked the age of 4th, he said he was 2 years older than the 3rd man. Asked the third person, and said that the 2nd People's Congress two years old. Ask the 2nd person, who says two years older than the first one. Finally asked the first person, he said is 10 years old. How old is the fifth one?My Code:def Fun (x)

Today the second way, do tomorrow can rest ~Original title Link: http://www.runoob.com/python/python-exercise-example8.htmlTitle: Output 9*9 multiplication tables.The result of the answer is:1*1=12*1=2 2*2=43*1=3 3*2=6 3*3=94*1=4 4*2=8 4*3=12 4*4=165*1=5 5*2=10 5*3=15 5*4=20 5*5=256*1=6 6*2=12 6*3=18 6*4=24 6*5=30 6*6=367*1=7 7*2=14 7*3=21st 7*4=28 7*5=35 7*6=42 7*7=498*1=8 8*2=16 8*3=24 8*4=32 8*5=40 8*6=48 8*7=56 8*8=649*1=9 9*2=18 9*3= 9*4= 9*5= 9*6= si 9*7= 9*8= 9*9=81My Code:defproduct ():

used. Deque does not support control over the timing of capacity and memory allocation. Inserting and deleting elements in addition to the ends will cause any pointers, references, iterators that point to the deque element to fail. However, Deque's memory redistribution is superior to vector because its internal structure shows no need to copy all elements. Deque memory chunks are no longer being used, they are freed, and the deque memory size is reduced. However, it is not done and

Extension (1): Enter an array to determine if the array has three digits I, J, K, satisfy I+j+k equals 0.Extension (2): If the input array is not sorted, but know the range of numbers inside, other conditions are unchanged, how to find these two numbers in O (n) time? The basic idea is to first use the hash table to achieve O (n) sorting (please refer to the question series 57th), the next steps are the same.[Programmer's Choice of 100

The sword refers to the sum of two digits of S.The sum of the points of offer and the successive positive sequence of sExtension (1): Enter an array to determine if the array has three digits I, J, K, satisfy I+j+k equals 0.Extension (2): If the input array is not sorted, but know the range of numbers inside, other conditions are unchanged, how to find these two numbers in O (n) time? The basic idea is to first use the hash table to achieve O (n) sorting (please refer to the question series 57th

, infer from the forward. 6 */7 8 Public classJava21 {9 Ten Public Static voidMain (string[] args) { One intsum = 1; A for(inti = 9; i > 0; i--) { -sum = (sum + 1) * 2; - } theSystem.out.println ("First day total pick up" + sum + "one"); - /*for (int i = 1; i - System.out.print ("first" + i + "days before eating" + sum + "a"); - int temp = SUM; + int eat = SUM/2 + 1; - sum = sum/2-1; + System.out.println (", eat" + Eat + "one, remainder" + sum + "one"); A

"Program 19"Title: If a number is exactly equal to the sum of its factors, this number is called the "end number". For example, 6=1+2+3. Programming to find all the finished numbers within 1000.1. Program Analysis: All the factors plus the number of comparisons.2. Program Source code:1 /*this article transferred from blog: www.cnblogs.com/java-1002 "program 19"3 title: If a number is exactly equal to the sum of its factors, this number is called the "end number". For example 6=1+2+3, programming

"Program 16"Title: Enter two positive integers m and N to find their greatest common divisor and least common multiple.1. Program analysis: From the decimal start to seek greatest common divisor, from the large number upward to seek least common multiple.2. Program Source code:1 /* This article goes from the blog: www.cnblogs.com/java-1002 "program 16"3 Title: Enter two positive integers m and N to find their greatest common divisor and least common multiple. 4 Program Analysis: From the decimal

"Program 12"Title: Determine the number of primes between 101-200 and the output of all primes.1. Program Analysis: The method of judging the prime number: The number is removed from 2 to sqrt (this number), if it can be divisible, it is not prime, the inverse is prime.2. Program Source code:1 /*this article transferred from blog: www.cnblogs.com/java-1002 "program 12"3 title: Determine the number of primes between 101-200 and the output of all primes. 4 Program Analysis: The method of judging p

"Program 7"Title: Output Special pattern, please run in C environment, take a look, Very beautiful!1. Program Analysis: A total of 256 characters. Different characters, graphics are not the same.2. Program Source code:1 /*this article transferred from blog: www.cnblogs.com/java-1002 "Program 7"3 Title: Output Special pattern, please run in C environment, take a look, Very beautiful!4 1. Program Analysis: A total of 256 characters. Different characters, graphics are not the same. 5 */6 7 Public

"Program 26"Title: Using recursive method to find 5!.1. Program Analysis: FN=FEC (fn-1)!2. Program Source code:1 /*this article transferred from blog: www.cnblogs.com/java-1002 "program 26"3 title: Using recursive method to find 5!. 4 Program Analysis:5 */6 7 Public classJava26 {8 9 Public Static voidMain (string[] args) {TenSystem.out.print (Fac (5)); One } A - Public Static intFac (intfn) { - if(fn > 1) { the return(FN * FAC (fn-1)); -}Else { -