cKK

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

导航

2016年6月25日

摘要: /* 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 阅读(207) 评论(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 阅读(134) 评论(0) 推荐(0) 编辑