CareerCup
XWang2014_SK
这个作者很懒,什么都没留下…
展开
-
CareerCup 17.12 Pair sum equal to a fixed value
第一种方法建立哈希表 第二种方法,利用ordered array线性检测 /* * Question 17.12 */ public void pairSum(int[] nums, int sum) { Arrays.sort(nums); // Array Class static function int first = 0, last = num原创 2013-02-19 18:23:49 · 235 阅读 · 0 评论 -
CareerCup 5.7
An array A[1...n] contains all the integers from 0 to n except for one number which is missing. In this problem, we cannot access an entire integer in A with a single operation. The elements of A ar原创 2013-02-26 17:12:03 · 263 阅读 · 0 评论