新手求助.大家帮我看一下这道题
public class mayer16 {public static void main(String[] args) {
int[] num = new int[]{ 1, 3, 4, 5, 7, 8 };
int[] nums = new int []{ 2, 3, 5, 6, 7, 9, 11 };
for (int i = 0; i < num.length; i++) {
for (int j = 0; j < nums.length; j++) {
if (num[i] == nums[j]) {
System.out.println(num[i]);
}
}
}
}
}
这个是求出num和nums两个数组之间相同的数.怎么写能求出num有.nums没有的数.
----------------解决方案--------------------------------------------------------
public class XDeng {
public static void main(String []args) {
int[] s1 = new int[]{ 1, 3, 4, 5, 7, 8 };
int[] s2 = new int []{ 2, 3, 5, 6, 7, 9, 11 };
for(int i = 0 ; i < s1.length ; i++)
{
for(int j = 0 ; j < s2.length ; j++)
{
if(s1[i] == s2[j])
{
s1[i] = s2[j]= 0;
break;
}
}
}
System.out.println("整型数组s1中有,数组s2没有的元素有:");
for(int i = 0 ; i < s1.length ; i++)
{
if(s1[i] != 0)
{
System.out.print(" " + s1[i]);
}
}
System.out.println();
System.out.println("整型数组s2中有,数组s1没有的元素有:");
for(int j = 0 ; j < s2.length ; j++)
{
if(s2[j] != 0)
{
System.out.print(" " + s2[j]);
}
}
}
}
----------------解决方案--------------------------------------------------------
public class mayer16 {
public static void main(String[] args) {
int[] num = new int[]{ 1, 3, 4, 5, 7, 8 };
int[] nums = new int []{ 2, 3, 5, 6, 7, 9, 11 };
for (int i = 0; i < num.length; i++) {
for (int j = 0; j < nums.length; j++) {
if (num[i] == nums[j]) {
break; }
System.out.print(num[i]);
}
}
}
}
----------------解决方案--------------------------------------------------------
程序代码:
import java.util.*;
public class Test {
public static void main(String[] args) {
int[] num = { 1, 3, 4, 5, 7, 8 };
int[] nums = { 2, 3, 5, 6, 7, 9, 11 };
Map<Integer, Integer> mNum = new HashMap<Integer, Integer>();
Map<Integer, Integer> mNums = new HashMap<Integer, Integer>();
for (int i = 0; i < num.length; i++)
mNum.put(num[i], num[i]);
for (int i = 0; i < nums.length; i++)
mNums.put(nums[i], nums[i]);
for (int i = 0; i < num.length; i++)
if (mNums.get(num[i]) == null)
System.out.println(num[i]);
}
} /* Output:
E:\Program\Java\bccn\2011-10-10>javac Test.java
E:\Program\Java\bccn\2011-10-10>java Test
1
4
8
E:\Program\Java\bccn\2011-10-10>
*/
public class Test {
public static void main(String[] args) {
int[] num = { 1, 3, 4, 5, 7, 8 };
int[] nums = { 2, 3, 5, 6, 7, 9, 11 };
Map<Integer, Integer> mNum = new HashMap<Integer, Integer>();
Map<Integer, Integer> mNums = new HashMap<Integer, Integer>();
for (int i = 0; i < num.length; i++)
mNum.put(num[i], num[i]);
for (int i = 0; i < nums.length; i++)
mNums.put(nums[i], nums[i]);
for (int i = 0; i < num.length; i++)
if (mNums.get(num[i]) == null)
System.out.println(num[i]);
}
} /* Output:
E:\Program\Java\bccn\2011-10-10>javac Test.java
E:\Program\Java\bccn\2011-10-10>java Test
1
4
8
E:\Program\Java\bccn\2011-10-10>
*/
----------------解决方案--------------------------------------------------------