java practice exam

(). Getannotation (Table.Class); sql+=Tab.name () +"Set";Get Table name StringWH ="";Record Field name String k=""; Boolean bl=false;Record whether the primary key is emptyfor (FieldFl:fiels) {Cyclic assemblyFl.setaccessible (TRUE);Turn on access to a private variable Object tobj=Fl.Get (obj);if (tobj!=null) {IfFl.isannotationpresent (Key.Class)) {Determine if there is a primary key bl=true; k=Fl.getname () +"= '" +tobj.ToString () +"' Where";}else{if (!Fl.isannotationpresent (Notrecord.Class))

();System.out.println ("please Enter your weight");Scanner sc3=new Scanner (system.in);String B=sc3.nextline ();Double gao=double.parsedouble (a), zhong=double.parsedouble (b), bz=gao-100;If (bz-zhong>=-3 bz-zhongSystem.out.println ("you are the standard weight");}else if (bz-zhongSystem.out.println ("you are overweight");}else{System.out.println ("you are thin");}}else if (sex.equals ("female")){System.out.println ("please Enter your height");Scanner sc2=new Scanner (system.in);String A=sc2.n

) { inti = 0, J = 0; while(i Rightarray.length) {if(leftarray[i] >=rightarray[j]) Array[start+ +] = leftarray[i++]; ElseArray[start+ +] = rightarray[j++]; } while(i ]; while(j ]; } public voidPrintresult (int[] array,int[] [] Query) { int[] result =New int[query.length]; for(inti = 0;i ) { int[] Temparray =New int[array.length];//this gets the cloned object of the array, requiring the address to be Changed. If you assign a value directly, the two addre

>a;i--) {//Outputs 5 spaces for a loop, reducing this to 1;Systen.out.print (""); The loop output space is not bhakta;} Systen.out.println ("*"); The first line ends with a newline so use println;} else{for (int i = 5;i>a;i--) {//Outputs 5 spaces for a loop, reducing this to 1;Systen.out.print (""); The loop output space is not bhakta;Systen.out.println ("*"); Then the output space, plus *;if (a==5/2+5%2) {//is taken to the middle value;for (int b =1;bSysten.out.print (""); The loop output space

("findpathbydfs:a to K"); M.findpathbydfs (A,K); System.out.println (); System.out.println ("Findpathbybfs:a to K "); M.FINDPATHBYBFS (A,K); System.out.println (); System.out.println ("Bellmanford from A:"); M.bellmanford (a); System.out.println (); System.out.println ("Dijkstra from A:"); M.dijkstra (a); System.out.println (); System.out.println ("bellmanford,print example from A:"); M.floydwarshall (); M.printfloydwarshallforonecity (a);}}Import Java.util.arraylist;import Java.util.linkedlist

7.Reverse IntegerThe idea of solving problems: Using code that enforces type conversions, first using long, then judging values and then forcing them into int1 Public classSolution {2 Public intReverseintx) {3 LongReverse_n =0;4 while(X! =0) {5Reverse_n = Reverse_n *Ten+ x%Ten;//Key Code6x = x/Ten;7 }8 if(Reverse_n > Integer.max_value | | Reverse_n integer.min_value) {9 return 0;Ten } One return(int) Reverse_n; A } -}9. Palin

Recently Java opened an object-oriented curriculum, the teacher assigned the homework, ah, that is, what homework I don't how to describe, code as follows, do their own, code is very immature, please understand! That's about it:classstudent{PrivateString Stuno; PrivateString name; Private floatMath; Private float中文版; Private floatcomputer; /*Student () {}*/ Public voidstuper (String stuno,string name) { This. Stuno =Stuno; This. Name =name; }

void main (string[] args) {Scanner s=new Scan NER (system.in); System.out.println ("Please enter the pet you wish to select"); System.out.println ("the Rabbit"); System.out.println ("2--penguin");p et p=null; String S1=s.nextline (), if ("1". Equals (S1)) {System.out.print ("Please enter your pet name"); String S2=s.nextline (); System.out.print ("Please enter your pet's gender"); String s3=s.nextline ();p =new Tuzi (S2,S3);} else if ("2". Equals (S1)) {System.out.print ("Please enter your pet

This article is from the "sub-larvae" blog, the original link: http://zhangjunhd.blog.51cto.com/113473/68949The Observer pattern is implemented in Java through the observable class and the Observer interface. The Observer object is the observer, and the observable object is the observer.1.implementing the Observer patternImplementing the Observer pattern is very simple, [1] creates the Observer class, which inherits from the Java.util.Observable class

PrivateRabbittemplate rabbittemplate; Public void SendCall(String content) { for(inti =1; I 3; i++) {LongExpiration = i * the; String message = i +"-"+ content; System. out.println(String. Format("Sender:%s", message)); Rabbittemplate.Convertandsend(Mqconstant.Delay_call_ttl, (Object) message,New Expirationmessagepostprocessor(expiration)); } }}Server:@Componentpublic class Server { @Async @RabbitHandler @RabbitListener(queues = MQConstant.CALL) public void callProcess(String

Exercise 1: (1) Create a class in a package that creates an instance of the class outside the package where the class is located.Import Mil.oms.main.test.Test; Public class maintest {public static void Main (String args[]) { Test test=new test (); } /** Run result test () instantiation ... Package Mil.oms.main.test;public class Test{public Test () {System.out.println ("Test () instantiation ...");}Exercise 2: (1) rewrite the code snippet in this section as a c

Frame1_jbutton2_actionadapter (this)); Jlabel2.settext ("First off: 10"); Jlabel2.setbounds (New Rectangle (414, 473, 171, 21)); Contentpane.add (JPANEL1); Contentpane.add (JButton2); Contentpane.add (JButton1); Contentpane.add (JSlider1); Contentpane.add (JLABEL1); Contentpane.add (JLABEL2); This.addkeylistener (New MyListener ()); Jbutton1.addkeylistener (Ne

generated mines in rows and columns intRR =Rnd.nextint (R); intCC =Rnd.nextint (c); if(A[rr][cc]!=-1) {A[RR][CC]=-1; N--; } } //Demining for(inti=0;i) { for(intj=0;j) { intLei=0; if(A[i][j] = = 0) { if(i-1>=0 j-1>=0 a[i-1][j-1]==-1) Lei++; if(I-1>=0 A[i-1][j]==-1) Lei++; if(j) { if(I-1>=0 A[i-1][j+1]==-1) Lei++; if(A[i][j+1]==-1) Lei++; }

country = Sc.next (); System.out.print ("\ n Please enter province:"); String province = Sc.next (); System.out.print ("\ n Please enter street:"); String Street = Sc.next (); System.out.print ("\ n Please enter house number:"); String id = sc.next (); System.out.print ("\ n Please enter your account's initial balance:"); Double money = sc.nextdouble (); Address address = new Address(country,province,street,id); User user = new User(code,name,password,address,money,new Da

Result:1 //Note: Hao2 //function: Display the diamond on the console3 //Date: 2018.08.094 5 Public classdiamond{6 Public Static voidMain (String []args) {7 intlay=10, i,j,k;8 //Upper Part 9 Floor9 for(i=1;i){Ten for(k=1;k){ OneSystem.out.print (""); A } - for(j=1;j){ -System.out.print ("*"); the } - System.out.println (); - } - //lower half 10 layers + for(i=1;i){ - for(k=1;k){

If the specified index is negative *@since1.4*/ Public voidSetintBitindex,Booleanvalue) { if(value) set (Bitindex); ElseClear (Bitindex); }/*** Sets the bit specified by the index to {@codefalse}. * * @paramBitindex the index of the bit to be cleared *@throwsindexoutofboundsexception If the specified index is negative *@sinceJDK1.0*/ Public voidClearintBitindex) { if(Bitindex ) Throw NewIndexoutofboundsexception ("Bitindex Bitindex); intWordindex =Wordindex

two numbers in {8, 9, 10}, respectively 8 and 9, from {PiDelete them and add 17 to the {10, 17} and the cost is 17.4. Find the minimum two numbers in {10, 17}, respectively 10 and 17, from {PiDelete them and add 27 to the {27} at a cost of 27.5. Now, only one number 27 is left in the sequence, and the construction process ends with a total cost of 5+10+17+27=59. Input format the first line of input contains a positive integerN（NNext isNA positive integer that representsP0,P1,...,PN-1, no more t

reliability for LANs. For example, the video conferencing system, does not require audio and video data is absolutely correct, as long as the consistency can be guaranteed, in this case, it is obvious that using UDP is more reasonable.third, what is the socketSockets are also commonly referred to as "sockets," which describe IP addresses and ports, and are a handle to a communication chain. The two programs on the network realize the exchange of data through a two-way communication connection,

You need to implement a multithreaded concurrency business scenario, start several sub-threads, and finally end up with all the child threads running at the end. (Task WaitAll similar to. NET)The Executorservice multithreaded programming model in Java provides a mechanism for introducing it through code.Method One: Executorservice#awaittermination/** * Blocks until all tasks has completed execution after a shutdown * request, or the timeout oc

Title DescriptionThe Yang Hui triangle is also called the Pascal Triangle, and its i+1 line is the expansion coefficient of (a+b) I.One of its important properties is that each number in the triangle is equal to the number of its two shoulders.The first 4 lines of the Yang Hui triangle are given below:11 11 2 11 3 3 1Gives N and outputs its first n rows.Input formatThe input contains a number n.Output formatOutputs the first n rows of the Yang Hui Triangle. Each line starts with the first number