理解leetcode解法
文章平均质量分 91
wx-泡
ACT独游开发
展开
-
[理解leetcode解法]1.TwoSum 两数之和
1.TwoSum 两数之和题目忘记复制了 - -...bool lessthan(const pair& lhs, const pair& rhs) { if (lhs.first == rhs.first) return lhs.second return lhs.first } //1class So原创 2016-03-02 15:09:38 · 812 阅读 · 0 评论 -
[理解leetcode解法]190. Reverse Bits 数字翻转
190. Reverse Bits 数字翻转Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (repr原创 2016-03-02 15:13:12 · 799 阅读 · 0 评论 -
[理解leetcode解法]30. Substring with Concatenation of All Words找子串
[理解leetcode解法]30. Substring with Concatenation of All Words找子串原创 2016-03-02 15:23:28 · 461 阅读 · 0 评论 -
[理解leetcode解法]98. Validate Binary Search Tree 判断是否二分查找树
[理解leetcode解法]98. Validate Binary Search Tree 判断是否二分查找树原创 2016-03-02 15:37:51 · 294 阅读 · 0 评论 -
[理解leetcode解法]264. Ugly Number II
[理解leetcode解法]264. Ugly Number II原创 2016-03-02 15:49:46 · 489 阅读 · 0 评论 -
[理解leetcode解法]176. Second Highest Salary
[理解leetcode解法]176. Second Highest Salary原创 2016-03-02 15:58:14 · 1024 阅读 · 0 评论