Java-Array
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
class Main {
public static void main(String[] args) {
int[] arry = {2,4,6,36,7,8};
//遍历
for(int i = 0; i < arry.length; i++)
System.out.print(arry[i] + ",");
//最值
int maxValue = arry[0];
for(int j = 1; j < arry.length; j++)
{
if(maxValue < arry[j])
{
maxValue = arry[j];
}
}
System.out.print("数组中最大的值为：" + maxValue);
System.out.print("\n");
//插入
int number = 34;
int[] arry2 = new int[arry.length + 1];
for(int k = 0; k < arry.length ; k++)
arry2[k] = arry[k];
arry2[3] = number;
for(int k = 4; k < arry2.length ; k++)
{
arry2[k] = arry[k-1];
}
System.out.print("插入之前：");
for(int k = 0; k < arry.length ; k++)
{
System.out.print(arry[k] + ",");
}
System.out.print("插入之后：");
for(int k = 0; k < arry2.length ; k++)
{
System.out.print(arry2[k] + ",");
}
//冒泡排序
System.out.print("\n冒泡排序：\n");
for(int i = 1; i < arry2.length; i++)
for(int j = 1; j < arry2.length; j++)
{
if(arry2[j] < arry2[j - 1])
{
int temp;
temp = arry2[j - 1];
arry2[j - 1] = arry2[j];
arry2[j] = temp;
}
}
for(int k = 0; k < arry2.length ; k++)
{
System.out.print(arry2[k] + ",");
}
}
}
Java
INFO