how to prepare for java interview

[LeetCode-interview algorithm classic-Java implementation] [066-Plus One (add One)], leetcode -- java [066-Plus One (Plus One )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given a non-negative number repre

Java testing, java interview 1. Can a ". java" source file contain multiple classes (not internal classes )? What are the restrictions? , There can be multiple classes, but only one public class is allowed, and the public class name is the same as the file name 2. Does Java

Java basics for Java programmer test interview 1. ==difference between equals and hashcode ① = Is used to compare whether a value is equal, or to compare whether the reference is equal, that is, to compare whether it points to the same object. ② The equals method is the method provided by the Object. Therefore, each Object has the equals method and its implementa

[Additional Points for the interview] java custom annotation declarative annotation, java custom Previous blog posts.First, we need to declare an annotation. The declaration code is as follows: Import java. lang. annotation. documented; import java. lang. annotation. elemen

In the interview, the salary this piece is obliged to talk, even if the HR does not take the initiative to raise the problem of salary, you also have to take the initiative to follow its natural and HR talk about wages. Why is it natural? Because in the interview talk about salary is also a technical work, such as talk too early, then your interview communication

[LeetCode-interview algorithm classic-Java implementation] [216-Combination Sum III (Sum of the number of combinations)], leetcode -- java [216-Combination Sum III (Sum of the number of combinations )][LeetCode-interview algorithm classic-Java implementation] [directory inde

have been usedSingle Case design modeFactory design PatternTemplate design PatternDecorative design patternProxy design modeAdapter design mode 1.10 Write a singleton pattern outa hungry man modepublic Class A single {//Private constructors in this classPrivate single () {}//create this type of objectprivate static Single S = new single ();//provide external access to the original object methodPublic Static Single getinstance () {return s;}}Note the problem:because the outside world cannot cre

Java Collection interview question summary, java Collection Summary1. What is a Java set API?Java Collection framework API is a unified framework used to represent and operate a set. It contains interfaces, implementation classes, and programming algorithms that help program

+ //Example 4 - //Interview question: Please design an expression to determine whether a data is an odd number $ //System.out.println (5%2); $ //System.out.println (5%-2); - //System.out.println ( -5%2); - //System.out.println ( -5%-2); the //result 1,1,-1,-1 - //Conclusion:% is the symbol that provides the result of the operation by the preceding operandWuyi return(i%2!

Main (string[] args){Inti = 1,k = 0;do{if (i%3==0){if (kSystem.out.println (i);k++;}i++;}while (i}}Class for{publicstatic void Main (string[] args){Inti = 1,k = 0;for (; i{if (i%3==0k{System.out.println (i);k++;}}}}19. Nested Loops and Process ControlNested loops: Loop inside loopAssuming that the number of cycles in the outer loop is M, the number of cycles in the loop is n times, then the number of cycles in the inner loop needs M * N times.Eg: The multiplication table is printed using the ne

[LeetCode-interview algorithm classic-Java implementation] [219-Contains Duplicate II (including Duplicate element II)], leetcode -- java [219-Contains Duplicate II (including Duplicate element II )][LeetCode-interview algorithm classic-Java implementation] [directory indexe

of objects. 1.9 used to design patterns. Single case design mode factory design pattern template design Pattern decoration design mode proxy design mode adapter design mode 1.10 Write a singleton mode out a hungry man mode public class Single {// Private the constructor in this class, the private single () {}//creates this class object private static Single S = new single ();//provides external access to the original object method public static single GetInstance () {return s;}} Note: Because t

[LeetCode-interview algorithm classic-Java implementation] [098-Validate Binary Search Tree (verify Binary Search Tree)], leetcode -- java [098-Validate Binary Search Tree (verify Binary Search Tree )][LeetCode-interview algorithm classic-Java implementation] [directory inde

of course this question did not answer ... Back to do the interview question when found, as if people like to ask this question, in fact very simple ...(2) asked what the database, and then I said SQL and MySQL, asked my paging SQL statement is what, this is a bit vague at that time, because I wrote this SQL statement when the site, but then nervous or what, is not to come out, then he told me that SQL is: select top The student where ID in (select t

[LeetCode-interview algorithm classic-Java implementation] [009-Palindrome Number (Number of replies)], leetcode -- java [009-Palindrome Number (Number of replies )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original quest

[LeetCode-interview algorithm classic-Java implementation] [013-Roman to Integer (Roman to Integer)], leetcode -- java [013-Roman to Integer (Roman to Integer )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question

[LeetCode-interview algorithm classic-Java implementation] [062-Unique Paths (Unique path)], leetcode -- java [062-Unique Paths (Unique path )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question A robot is located

[LeetCode-interview algorithm classic-Java implementation] [058-Length of Last Word (Length of the Last Word)], leetcode -- java [058-Length of Last Word (Length of the Last Word )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all question

[LeetCode-interview algorithm classic-Java implementation] [075-Sort Colors (Color Sorting)], leetcode -- java [075-Sort Colors (Color Sorting )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given an array w

[LeetCode-interview algorithm classic-Java implementation] [067-Add Binary (Binary addition)], leetcode -- java [067-Add Binary (Binary addition )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given two bina