|
||
|
摘要：
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { ... 阅读全文
posted @ 2016-06-29 11:37 cKK 阅读(159) 评论(0) 推荐(0)
摘要：
/* Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2]. Note: Each element in the result should appear as many times... 阅读全文
posted @ 2016-06-25 15:07 cKK 阅读(217) 评论(0) 推荐(0)
摘要：
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum pro 阅读全文
posted @ 2016-06-25 14:19 cKK 阅读(137) 评论(0) 推荐(0)
摘要：
Given a non-empty array of integers, return the k most frequent elements. For example,Given [1,1,1,2,2,3] and k = 2, return [1,2]. Note: You may assum 阅读全文
posted @ 2016-06-24 16:14 cKK 阅读(203) 评论(0) 推荐(0)
摘要：
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except 阅读全文
posted @ 2016-06-23 10:09 cKK 阅读(117) 评论(0) 推荐(0)
摘要：
Given an array of integers, every element appears three times except for one. Find that single one. Note:Your algorithm should have a linear runtime c 阅读全文
posted @ 2016-04-19 14:00 cKK 阅读(160) 评论(0) 推荐(0)
摘要：
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: But the fol 阅读全文
posted @ 2016-04-12 21:06 cKK 阅读(137) 评论(0) 推荐(0)
摘要：
Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a lette 阅读全文
posted @ 2016-04-12 15:26 cKK 阅读(195) 评论(0) 推荐(0)
摘要：
Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
posted @ 2016-04-12 02:14 cKK 阅读(106) 评论(0) 推荐(0)
摘要：
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the 阅读全文
posted @ 2016-04-11 23:49 cKK 阅读(118) 评论(0) 推荐(0) |
||
浙公网安备 33010602011771号