cKK

............当你觉得自己很辛苦，说明你正在走上坡路.............坚持做自己懒得做但是正确的事情，你就能得到别人想得到却得不到的东西............

导航

06 2016 档案

(Tree)94.Binary Tree Inorder Traversal

摘要：/** * 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 阅读(162) 评论(0) 推荐(0)

(Collection)350. Intersection of Two Arrays II

摘要：/* 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 阅读(220) 评论(0) 推荐(0)

（dp）343. Integer Break

摘要：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 阅读(140) 评论(0) 推荐(0)

(Collection)347. Top K Frequent Elements

摘要：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 阅读(213) 评论(0) 推荐(0)

(Skill)238. Product of Array Except Self

摘要：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 阅读(127) 评论(0) 推荐(0)