摘要: 传统的做法:public static void main(String[] args) { // 给一个数组, 19个整数, 范围1-20, // {1,2,9,11,3,5,7,4,6,8,10,13,14,15,17,16,19,18,20}. // 请编程找出该数组缺少1-20中的哪个数 int[] a = { 1, 2, 9, 11, 3, 5, 7, 4, 6, 8, 10, 13, 14, 15, 17, 16, 19, 18, 20 }; for (int i = 1; i <= 20; i++) { boolean flag = false; for (i... 阅读全文
posted @ 2012-09-11 08:13 IT达芬奇 阅读(1370) 评论(1) 推荐(0)