2017年9月2日
摘要：
1 Find Peak Element public int findPeak(int[] a) { // write your code here if (a == null || a.length <= 2) return -1; int start = 0; int end = a.lengt 阅读全文
posted @ 2017-09-02 11:59
wheleetcode
阅读(114)
评论(0)
推荐(0)
摘要：
1 Two Sum public int[] twoSum(int[] numbers, int target) { int[] res = {-1, -1}; if (numbers == null || numbers.length < 2) { return res; } Map<Intege 阅读全文
posted @ 2017-09-02 10:54
wheleetcode
阅读(98)
评论(0)
推荐(0)
浙公网安备 33010602011771号