package Shiyan2;
public class Test2 {
public static void main(String[] args) {
String str1[] = {"Hello","World!"};
String str2[] = {"abc","def"};
int a1[] = {1,2,3,4,5};
int a2[] = {6,7,8,9,0,10};
int a3[] = {1,2,3,4,5};
int a4[] = {5,6,7,4};
Array.turnOver(str1);
System.out.println("");
Array.turnOver(str2);
System.out.println("");
Array.add(a1, a2);
System.out.println("");
Array.Minus(a3, a4);
}
}
//倒序输出
class Array
{
public static void turnOver(String str[])
{
for(int i = str.length - 1;i >= 0 ;i--)
{
System.out.printf(str[i]);
}
}
//并集
public static void add(int[] a,int[] b)
{
int[] c = new int[20];
int k = a.length;
for(int i = 0; i < a.length;i++)
{
c[i] = a[i];
}
for(int i = 0;i < b.length;i++)
{
int o = 0;
for(int j = 0;j < k;j++)
{
if(b[i] == c[j])
{
o = 1;
}
}
if(o == 0)
{
c[k++] = b[i];
}
}
for(int i = 0;i < k;i++)
{
System.out.print(" " + c[i]);
}
}
//交集
public static void Minus(int[] a,int[] b)
{
int[] c = new int[20];
int k = 0;
for(int i = 0;i < a.length;i++)
{
for(int j = 0;j < b.length;j++)
{
if(a[i] == b[j])
{
c[k++] = b[j];
break;
}
}
}
for(int i = 0;i < k;i++)
{
System.out.print(" " + c[i]);
}
}
}
定义一个类,该类中包含以下几个方法(静态): 实现两个字符串数组的逆序排序,输出结果为字符串数组; 求两个整形数组的交集; 求两个浮点型数组的并集;
最新推荐文章于 2022-08-01 21:04:21 发布