onenote classroom

Today I reviewed the types of sentences that I learned yesterday. Statement types fall into three categories: sequential, branching, and looping.Branch statements:Aif (an expression){}Description1. The expression returns a bool value;2. Parentheses and braces do not need to be appended with semicolons.Twoif (an expression){}Else{}Threeif (an expression){}else if{}else if{}...Else{}Each situation can only go one of them, if none of the above go, will execute else inside.Fourif (an expression){if

1.stringconstructors.javaIn Java, the same string constant "Hello" saves only one copy to save memory, S0,S1,S2 refers to the same object;When compiling S2, the compiler will remove the "+" number and directly connect to a string;When using new to create a string object, the value is the same, but the reference is two objects2.When assigning a value to a string variable, the two string variable s1,s2 refers to the same object "a";The content of the string object is read-only, and the "+" number

A preliminary analysis of the requirements of the topic:1. Determine if two random numbers are the sameSave (cycle) The resulting topics and compare the results (loops).2. Add more than one variable num to control the number of questions3, in each switch select the statement, make a choice to judge3.1 Choose whether there is a multiplication method,3.2 Whether there are parenthesesDetermine whether the subtraction is present, add or subtract the position in the calculation, and then choose wheth

//define an empty string, string stra = string. Empty; Stra = "ABCDESABCSKKKKK"; Gets the length of the string int i = Stra.length; The letters are converted to lowercase stra = stra.tolower (); The letters are converted to uppercase Stra = Stra.toupper (); Remove the front and back whitespace characters stra = Stra.trim (); Remove the previous whitespace character stra = Stra.trimstart (); After removing the

Water king { if(idcou[0]==0 shuiwang[i]!=id[1] shuiwang[i]!=id[2]) {idcou[0]=1; id[0]=Shuiwang[i]; } Else if(idcou[1]==0shuiwang[i]!=id[0] shuiwang[i]!=id[2]) {idcou[1]=1; id[1]=Shuiwang[i]; } Else if(idcou[2]==0shuiwang[i]!=id[0] shuiwang[i]!=id[1]) {idcou[2]=1; id[2]=Shuiwang[i]; } Else if(shuiwang[i]!=id[0] shuiwang[i]!=id[1] shuiwang[i]!=id[2]) {idcou[0]--; idcou[1]--; idcou[2]--; } Else if(shuiwang[i]==id[0]) {idcou[0]++; } Else if(shuiwang

person appears 1 times with high, low and itself has a certain relationship. The sum can be obtained, the decimal number ABCDE calculates the number of hundreds (c) appear 1 times, if the hundred is 0, then the number of 1 on the Hundred is (AB) *100, if the Hundred is 1, then the number of 1 on the Hundred is (AB) *100+cde+ 1, if the number on the hundred is greater than 1. The number of 1 on the Hundred is (ab+1) *100.Third, the source code#include intFindintnum) { intCount=0;//define a va

First, the topic requirementsGiven a positive integer in decimal, write down all integers starting with 1, to N, and then count the number of "1" that appears. Requirements: 1, write a function f (n), returns the number of "1" that occurs between 1 and N. For example F (12) = 5. 2. In the range of 32-bit integers, the maximum n of "f (n) =n" satisfying the condition is what.　　Second, design ideas (1) One-time f (0) =0;f (1) =1;f (2-9) = 1;　　　　(2) Two digits F (10) =1+ (0+1) = 2;　　　　F (11) = (+)

TargetMake a carousel diagram with 5 imagesAnalysisTo make a carousel diagram, you need the following 3 steps:1, after the page opens, the first picture shows, the rest of the picture, hidden2, the picture interval 5 seconds to turn the broadcast once3, to the 5th map back to the 1th sheetProduction1, after the page opens, the first picture shows, the rest of the picture, hidden:$ (". BG"). Not (": eq (0)"). Hide ();2, Interval 5 seconds Carousel:Var i=0;$ (function () {$ (". BG"). Not (": eq (0

middle of the array ID number, is definitely the ID number of the water king. The time complexity is reduced to O (N*logn) at this point.Train of thought 3: We can use the mobile games we usually play the idea of a small star, if the next two adjacent ID number is different, it will be eliminated, because the number of water King post more than half of the total number of posts,Therefore, the Water King ID number must be adjacent. This is the time complexity of O (N).Three, code#include using n

experiment is done, there are a lot of follow-up work to be done, algorithm optimization and the ID of the irrigation posts are to solve the problem. Careful analysis will find that the topic said a lot of nonsense, in fact, to convey to us only three points of information, 1, the maximum value of an array; 2, the maximum value is greater than the array of all the number and half; 3. Locate the maximum value and output the position of the array (that is, id). The difficulty of this problem is m

1. QuestionsBookstore for the "Harry Potter" series of books for promotional activities, a total of 5 volumes, with numbers 0, 1, 2, 3, 4, a single volume of 8 yuan, the specific discount is as follows:Discount on this number 2 5% 3 10% 4 20%5 25%Depending on the number of volumes purchased and this number, different discount rules will be applicable. The singular book only corresponds to one discount rule, for example, two volume 1, one volume 2, you can enjoy 5% discount, another

=arrid[i],x=1; } Else { if(shuiwang==Arrid[i]) { ++x; } Else { --x; }}} printf ("the water King's ID is:%d\n", Shuiwang); returnShuiwang;} intMainintargcChar*argv[]) { intarry[6]={3,4,3,2,3,3}; Find (Arry,6); return 0; }FourFive, Experience This class of training feel the teacher out of the problem more and more Test IQ, when the classmate said the middle ID must be water king's time, I still do not understand what

First, the topic requirementsA three-person line designed a forum for irrigation. Information college students like to exchange irrigation above, legend in the forum there is a "water king", he not only likes to post, but also reply to other ID issued by each post. The "Water King" has been rumored to have posted more than half the number of posts. If you have a list of posts (including replies) for the current forum, and the ID of the author of the Post is in it, can you quickly find the legend

entry point of the console application. //#include"stdafx.h"#include"iostream"using namespacestd;intMain () {intb//define the number of books purchased intM,n; inti; Doublesum=0; cout"Please enter the number of books you need to purchase:"Endl; CIN>>b; M=b/5; N=b%5; I=n+5; if(i!=8) { Switch(n) { Case 0: Sum=m* +*0.75; Break; Case 1: Sum=m* +*0.75+8; Break; Case 2: Sum=m* +*0.75+ -*0.95; Break; Case 3: Sum=m* +*0.75+ -*0.9; Break; Case 4: Sum=m* +*0.75+ +*0.8; Break; } }

package's hierarchy must be (ACD) when it is described with a package statement. A. Same structure as file B. Same level as file directory C. Same as file type D. Same as file size 9. Which assignment statement is not legal? A a.float a = 2.0 b.double B = 2.0 C.int C = 2 D.long D = 2 10. The following statement is correct?　　CD A. The access modifier can decorate a data member, or it can modify a local variable.　　The b.static modifier can modify a data member, or it can modify a local variable.　

Online course on developing 3D games with Cocos2d-xsection Eighth: LightingVideo Address: Http://edu.csdn.net/course/detail/1330/20808?auto_start=1Exchange Forum: http://www.firestonegames.com/bbs/forum.phpProject: http://www.firestonegames.com/bbs/forum.php?mod=viewthreadtid=13extra=Course:Example Project Demo: Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced. Fire Cloud Development Classroom-

Classroom Exercise 21. Design IdeasThe first time a subarray of the largest and the program storage and the time of the two-dimensional array can not achieve the time complexity of O (n), and then there is no new ideas, from the Internet search an algorithm.The algorithm is to construct a function to return the maximum number of sub-arrays, and when the preceding few numbers are added up, after b2. SOURCE program#include UsingNamespaceStd#define N 15i

used the following methods to encrypt military information during the war:Please write a program, using the above algorithm to encrypt or decrypt the user input of the English string requirements design ideas, program flowchart, source code, results.Design idea: Enter the substring to encrypt str, define the length of the string, convert the string to a single character, +3 per character ,Move Backward 3 One, define Output , multibyte each new word to Output , the string is the encrypted strin

the target character array.4, String.Replace () replaces the element or substring in the original string. Returns the replaced string.5. String.touppercase () capitalizes the characters in string strings.6, String.tolowercase () to lowercase characters in string strings.7, String.Trim () remove the string header space.8, String.tochararray () converts a string to a character array.Four, string encryption.First, design ideas:Define the class, the dialog reads into string s1, defines a char array

); 12 system.out.println ("Please enter total number and number of pulls:"); n = scan.nextint (); k = scan.nextint (); int[][] y = new int[ n + 1][n + 1];17 y[0][0] = 1; for (i = 1;i ) {y[i][0] = y[i][i] = 1; (j = 1;j ) Y[i][j] = y[i-1][j-1] + y[i-1 }23 ("from" + N + "out" + k + "Total" + System.out.println] + "Kind of Combination" }27} (3) Using Yang Hui triangle principle to calculate the combined number recursively1//calculation combination number, using Yang Hui t