面试基础问题,小柠檬带你解决
数组判断
package com.test.demo;
public class ShuZuPanDuan {
public static void main(String[] args) {
int[] qweStrings = {1,-1,1,-6,-1,4,-2,1,1};
for (int i=0;i<qweStrings.length; i++){
if(qweStrings[i]<0){
qweStrings[i]=qweStrings[i]+5;
}else if(qweStrings[i]>0){
qweStrings[i]–;
}else{
}
}
for (int i:qweStrings){
System.out.println(i);
}
}
}
冒泡排序
package com.test.demo;
public class MaoPaoPaiXu {
public static void main(String[] args) {
int arr[]=new int[]{12,36,54,28,94,32};
int temp;
for(int i = 0 ;i<arr.length-1;i++){
for(int j=0;j<arr.length-i-1;j++){
if(arr[j+1]<arr[j]){
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
for(int i:arr){
System.out.println(i);
}
}
}
倒计时
package com.test.demo;
public class DaoJiShi {
public static void main(String[] args) throws InterruptedException {
for(int i=10;i>0;i–){
System.out.println(i+"!");
Thread.sleep(1000);
}
}
}下期再见!小柠檬等你们哟!爱你们!