随笔分类 - leetcode

leetcode && lintcode解题记录

摘要：379. Design Phone Directory Design a Phone Directory which supports the following operations: Example: 阅读全文

posted @ 2016-11-19 23:10 fripSide 阅读(261) 评论(0) 推荐(0)

6-5日

摘要：Max Points on a Line开始无脑匹配结果超时：class Solution {public: int maxPoints(vector &points) { int ans = 0; for (int i = 0; i ans) ans = num... 阅读全文

posted @ 2014-06-05 11:16 fripSide 阅读(133) 评论(0) 推荐(0)

摘要：Reverse Words in a String反转一个字符串垃圾方法：#include #include class Solution {public: void reverseWords(string &s) { istringstream is(s); st... 阅读全文

posted @ 2014-05-22 22:39 fripSide 阅读(137) 评论(0) 推荐(0)

日常任务天天挖坑
博客园首页新随笔联系订阅管理

公告