Leetcode
文章平均质量分 64
西瓜杀手
这个作者很懒,什么都没留下…
展开
-
Pascal's Triangle II Leetcode
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space? 代码: vectorFi原创 2015-05-07 15:03:13 · 441 阅读 · 0 评论 -
Happy Number LeetCode
Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares原创 2015-05-07 14:09:22 · 461 阅读 · 0 评论 -
Compare Version Numbers Leetcode
Compare Version Numbers Compare two version numbers version1 and version1. If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0. You may assume that the ve原创 2015-01-19 11:39:46 · 670 阅读 · 0 评论