java made easy

Write easy, the mood is also very smooth.The title means that if there is Val, then the subscript of Val is returned. If there is no Val, then find out where Val should be placed.ImportJava.io.*;ImportJava.util.*; Public classSolution { Public Static intSearchinsert (int[] Nums,inttarget) { intR=0; intlen=nums.length; if(len==0) return0; inti,j; I=0; while(iLen) { if(nums[i]target) {i++; } Else{R=i; Break; }

I decided to brush easy first.The weird thing about this problem is that not only do you have to output the length, you also have to change the nums[] array to clear out the number of redundancies. Like whatImportJava.io.*;ImportJava.util.*; Public classSolution { Public Static intRemoveDuplicates (int[] nums) { intR=0; intlen=nums.length; intI=0,j=0; if(len) return0; intCmp=nums[0]; intC=0; NUMS[J]=nums[0]; J++; for(i=1;i) {

); Msg.setsubject ("Seenews Error"); StringBuilder Builder=NewStringBuilder (); Builder.append ("url =" + "http://blog.csdn.net/never_cxb/article/details/50524571"); Builder.append ("\ nthe page crawler error"); Builder.append ("\ n Time" +NewDate (). GetTime ()); Msg.settext (Builder.tostring ()); Msg.setfrom (NewInternetAddress ("[Email protected]")); Transport Transport=Session.gettransport (); Transport.connect ("Smtp.163.com", "[email protected]", "* * your own e-mail address * *");

Some of the things that are easy to make mistakes in java-general Linux technology-Linux programming and kernel information. The following is a detailed description. 1) instanceof: the class object that implements an interface is also an instance of this interface; a certain class object is also an instance of this super class. 2) The native () modifier method does not have a method body. Use a semicolon

Easy-to-Forget knowledge in java, occasionally updated ......, Regular update... If someone asks you: "Is it true that the subclass inherits all non-private attributes and methods of the parent class? "If you are right, I can only say too young too simple! Modifier Problems Why is this sentence incorrect? As long as you have figured out the application scope of the four access modifiers, you will know.

Subclass inherits parent class represents sub-analogy his parent class contains more information and methodsWhen a subclass calls an overloaded construction method, it calls the constructor of the parent class, Super (); it is generally called implicitly if it is not written, and each call is preceded by all statements.In a function, a subclass can be used where the parent class is used, which is often said to be polymorphic, the actual type of the variable is the actual class of the object refe

false; Char[] c=S.tochararray (); inti; LinkedListNewLinkedlist(); intIndex=0; if(c[0]== ') ' | | c[0]== '] | | c[0]== '} ') return false; for(i=0;i) { Switch(C[i]) { Case' (': Linkl.add ("); Break; Case‘)‘: if(Linkl.getlast () = = "(") Linkl.removelast (); Else return false; Break; Case' [': Linkl.add ("["); Break; Case‘]‘: if(Linkl.getlast () = = "[") Linkl.removelast (); Else

The same idea as the previous question.ImportJava.io.*;ImportJava.util.*; Public classSolution { Public Static intRemoveelement (int[] Nums,intval) { intR=0; intlen=nums.length; intI=0,j=0; if(len==0) return0; intC=0; for(i=0;i) { if(val!=Nums[i]) {Nums[j]=Nums[i]; J++; } Else{C++; }} R=len-C; returnR; } Public Static voidMain (string[] args) {int[] a={1,1,1,1,4,5}; System.out.println (Removeelement (A,1)); int[] b={1,1,4,4,5}; System.out.print

true;}}return false;}Main function to testpublic static void Main (string[] args) {test01 entry=new test01 ();Entry.put ("Zhang San", New wife ("Little Red"));Wife W = (wife) entry.get ("Zhang San");//strong turn to convert object into wife classSystem.out.println (W.name);}}Defining classes that hold key-value pairsClass sxtentry{Object key;Object value;Public Sxtentry (Object key, object value) {Super ();This.key = key;This.value = value;}Define an empty constructor to make it easier to creat

Problem:After flipping x, determine if it is equal to X. Need to consider overflow. But if this number flips and overflows, then it is not a palindrome number.Reasoning into the next, if the number of rollover after the overflow and palindrome number, then the original number is also overflow. Contradiction. Public class Solution { publicboolean ispalindrome (int x) { if(x ) returnfalse; int y=0,z=x; while (x!=0) { y=y*10+x%10;

Problem:Traversal comparison.Talk about the idea seriously.The longest prefix.Once a mismatch is found, the longest prefix cannot be made.All we have to do is to find this mismatch.Note that if the string is empty, it will be planted here every time.To improve efficiency, find the shortest string, because the length of the longest prefix cannot exceed the length of the shortest string.ImportJava.io.*;ImportJava.util.*; Public classsolution{ Public Staticstring Longestcommonprefix (string[] strs)

- -CAMERAIP =(EditText) Findviewbyid (r.id.editip); inControlip =(EditText) Findviewbyid (R.ID.IP); -Port =(EditText) Findviewbyid (r.id.port); to +Videourl =Cameraip.gettext (). toString (); -Controlurl =Controlip.gettext (). toString (); thePort =Port.gettext (). toString (); * $ Panax Notoginseng //generate a Intent object -Intent Intent =NewIntent (); the //adds a key-value pair to the intent object +Intent.putextra ("Cameraip", Videourl); AIntent.putextra

1 ImportJava.util.Scanner;2 ImportJava.math.BigInteger;3 Public classMain {4 Public Static voidMain (string[] args) {5Scanner scan =NewScanner (system.in);6BigInteger A =Scan.nextbiginteger ();7BigInteger B =Scan.nextbiginteger ();8System.out.println (A + "+" +b+ "=" +A.add (b));9System.out.println (A + "-" +b+ "=" +A.subtract (b));TenSystem.out.println (A + "*" +b+ "=" +a.multiply (b)); OneSystem.out.println (A + "/" +b+ "=" +A.divide (b)); A } -}

1,equals@Test publicvoidtest_equal(){ String a="1"; int b=1; boolean result=a.equals(b); System.out.println(result); }Cause: Equals is automatically converted to the package type when comparedThe operating result is:Falseshould read:@Test publicvoidtest_equal(){ String a="1"; int b=1; boolean result=a.equals(String.valueOf(b)); System.out.println(result); }2, Package Type@Test publicvoidtest_equal2(){ Long a=229L;

Import Java.util.scanner;public class P2031 {public static void main (string[] args) {Scanner sc = new Scanner (system.in); c Har chs[] = {' 0 ', ' 1 ', ' 2 ', ' 3 ', ' 4 ', ' 5 ', ' 6 ', ' 7 ', ' 8 ', ' 9 ', ' A ', ' B ', ' C ', ' D ', ' E ', ' F '};//max hexadecimal all number while (Sc.hasnext ()) {int n = sc.nextint (); Number of conversions Required int r = Sc.nextint (); Binary Boolean isnegative = False required for conversion; Used to determine if there is a negati

can not be put, that is, the main diagonal. With these three conditions both are possible.5. The code is as follows:Import Java.util.Scanner;public class Eightqueen {static int qipan[][] = new INT[8][8];static int count = 0;static int step = 1;static int vis[][] = new INT[3][20]; Three cases main diagonal, diagonal, row has not been occupied.public static void Main (string[] args) {Initialize the boardfor (int i=0;ifor (int j=0;jQIPAN[I][J] = 0;}}for (int i=0;ifor (int j=0;jVIS[I][J] = 0;}}Move