摘要：Find thekth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For exampl... 阅读全文

摘要：Given an integer array of sizen, find all elements that appear more than⌊ n/3 ⌋times. The algorithm should run in linear time and in O(1) space.如果没有这时... 阅读全文

摘要：Given an array of sizen, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋times.You may assume that the arr... 阅读全文

摘要：public class Solution { public ListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode cur1 = l1; ListNode cur2 = l2; ListNod... 阅读全文

摘要：用 Hash Table 实现Time : O(n)Space: O(n)import java.util.HashMap;public class Solution { public int[] twoSum(int[] nums, int target) { HashMap ... 阅读全文