摘要:
public class Solution { public int findKthLargest(int[] nums, int k) { return find(nums,nums.length-k,0,nums.length-1); } public int f... 阅读全文
posted @ 2015-05-31 17:04
~每天进步一点点~
阅读(145)
评论(0)
推荐(0)
摘要:
Given an array of integers and an integerk, find out whether there there are two distinct indicesiandjin the array such thatnums[i] = nums[j]and the d... 阅读全文
posted @ 2015-05-31 15:02
~每天进步一点点~
阅读(180)
评论(0)
推荐(0)
浙公网安备 33010602011771号