最后
面试题文档来啦,内容很多,485页!
由于笔记的内容太多,没办法全部展示出来,下面只截取部分内容展示。
1111道Java工程师必问面试题
MyBatis 27题 + ZooKeeper 25题 + Dubbo 30题:
Elasticsearch 24 题 +Memcached + Redis 40题:
Spring 26 题+ 微服务 27题+ Linux 45题:
Java面试题合集:
r += word.charAt(i);
else
r += ‘*’;
}
return r;
}
public static boolean belongs(char key,char[] letters){
for (char letter : letters) {
if (letter == key)
return true;
}
return false;
}
public static boolean belongs(char key,String word){
for(int i=0;i<word.length();i++){
if(key==word.charAt(i))
return true;
}
return false;
}
public static int occurTime(char key,String word){
int count=0;
for(int i=0;i<word.length();i++) {
if (key == word.charAt(i))
count++;
}
return count;
}
}
=================================================================
package demo;
import java.util.*;
public class diqizhang {
public static void main(String[] args){
int[] queens = {0,1,2,3,4,5,6,7};
while(conflict(queens))
shake(queens);
for(int i=0;i<8;i++){
for(int j=0;j<queens[i];j++)
System.out.print("| ");
System.out.print(“|Q”);
for(int j=queens[i]+1;j<8;j++)
System.out.print("| ");
System.out.println(“|”);
}
}
public static boolean conflict(int[] queens){
int[] plus = new int[8];
int[] minus = new int[8];
for(int i=0;i<8;i++){
plus[i] = i+queens[i];
minus[i] = i-queens[i];
}
for(int i=0;i<8;i++){
if(occurTime(plus[i],plus)>1)
return true;
}
for(int i=0;i<8;i++){
if(occurTime(minus[i],minus)>1)
return true;
}
return false;
}
public static int occurTime(int key,int[] set){
int count=0;
for(int value : set){
if(key == value)
count++;
}
return count;
}
public static void shake(int[] str){
int len = str.length;
for(int i=0;i<len;i++){
int d = (int)(Math.random()*len);
int tmp = str[i];
str[i] = str[d];
str[d] = tmp;
}
}
}
=================================================================
package demo;
import java.util.*;
public class diqizhang {
public static void main(String[] args){
Scanner input = new Scanner(System.in);
System.out.print("Enter the number of balls to drop: ");
int balls = input.nextInt();
System.out.print("Enter the number of slots in the bean machine: ");
int numSlot = input.nextInt();
int[] slots = new int[numSlot];
for(int i=0;i<balls;i++)
drop(numSlot,slots);
for(int i=max(slots);i>=1;i–){
for(int j=0;j<numSlot;j++){
if(slots[j]<i)
System.out.print(" ");
else
System.out.print(“0”);
}
System.out.println();
}
}
public static void drop(int numSlot , int[] slots){
double b = 0;
for(int i=0;i<numSlot-1;i++){
if(Math.random()>0.5){
b += 0.5;
System.out.print(‘R’);
}else{
b -= 0.5;
System.out.print(‘L’);
}
}
总结
谈到面试,其实说白了就是刷题刷题刷题,天天作死的刷。。。。。
为了准备这个“金三银四”的春招,狂刷一个月的题,狂补超多的漏洞知识,像这次美团面试问的算法、数据库、Redis、设计模式等这些题目都是我刷到过的
并且我也将自己刷的题全部整理成了PDF或者Word文档(含详细答案解析)
66个Java面试知识点
架构专题(MySQL,Java,Redis,线程,并发,设计模式,Nginx,Linux,框架,微服务等)+大厂面试题详解(百度,阿里,腾讯,华为,迅雷,网易,中兴,北京中软等)
算法刷题(PDF)
链图片转存中…(img-JEVNdVHI-1715452438943)]
算法刷题(PDF)
[外链图片转存中…(img-bBnEEEbk-1715452438943)]