05 2015 档案

摘要: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 ~每天进步一点点~ 阅读(143) 评论(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 ~每天进步一点点~ 阅读(177) 评论(0) 推荐(0)
摘要:Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?/**... 阅读全文
posted @ 2015-05-05 14:33 ~每天进步一点点~ 阅读(147) 评论(0) 推荐(0)
摘要:Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?/** * Definition for singly-linked list. *... 阅读全文
posted @ 2015-05-05 14:30 ~每天进步一点点~ 阅读(114) 评论(0) 推荐(0)