本来想先写Android面试题的,发觉好像java基础其实也很重要,不管,初中高级的面试基本都会遇到java的面试题,只是难以程度不一样,还有要求的回答也不一样,下面把自己遇到过的java面试题,和网上搜集的较好的记录下来,供复习和参考.
1.如何实现一个字符串的反转.如“d6a4d5s4a”变成"d6a4d5s4a".
A:已知2种方式.
1API直接调用.
String num = "a4s5d4a6d"; String res = new StringBuffer(num).reverse().toString();
2.通过遍历的形式,逐个反转,然后组装
StringBuffer sp = new StringBuffer();
for (int i = num.length() - 1; i >= 0; i--) {
sp.append(num.charAt(i));
}
2.2个无穷大的String整形数字相加,比如"123...."+"478...",如何计算(基础题)
A:这个是之前头条面试的基础题,一般来说肯定有这么1.2道基础面试,因为技术好的人一般基础都不差,下面是答案代码。有4种解法,讲2个简单的,代码如下
import java.math.BigDecimal;
public class Calc {
public static void main(String[] args) {
//1.调用API BigDecimal
String num1 = "1231534654767464";
String num2 = "6879653131231";
BigDecimal result = new BigDecimal(num1).add(new BigDecimal(num2));
System.out.println("result:" + result.toString());
//2.反转字符串,缺位补0,然后相加,注意绝大数溢出位处理
reverse(num1, num2);
}
private static void reverse(String num1, String num2) {
//反转
String r1 = new StringBuffer(num1).reverse().toString();
String r2 = new StringBuffer(num2).reverse().toString();
//补0
int len1 = r1.length();
int len2 = r2.length();
if (len1 > len2) {
for (int i = len2; i < len1; i++) {
r2 += "0";
}
} else if (len1 < len2) {
for (int i = len1; i < len2; i++) {
r1 += "0";
}
}
boolean nOverFlow = false;
int maxLen = Math.max(len1, len2);
int[] sum = new int[maxLen+1];
for (int i = 0; i < maxLen; i++) {
if (nOverFlow) {
sum[i] = Integer.parseInt(r1.charAt(i) + "") + Integer.parseInt(r2.charAt(i) + "") + 1;
} else {
sum[i] = Integer.parseInt(r1.charAt(i) + "") + Integer.parseInt(r2.charAt(i) + "");
}
//处理溢出位
nOverFlow = handleSumOverTen(sum, i);
}
String result = "";
//处理最高位
if (nOverFlow) {
sum[maxLen] = 1;
} else {
sum[maxLen] = 0;
}
for (int i = 0; i < sum.length; i++) {
result += String.valueOf(sum[i]);
}
String input = new StringBuffer(result).reverse().toString();
System.out.println("result:" + input);
}
private static boolean handleSumOverTen(int[] sum, int i) {
boolean flag;
if (sum[i] >= 10) {
sum[i] = sum[i] - 10;
flag = true;
} else {
flag = false;
}
return flag;
}
}