摘要：
It is all about corner cases.class Solution {public: vector retv; bool isValid(string &sub) { unsigned cnt = sub.length(); if (... 阅读全文
posted @ 2014-08-02 11:07
Tonix
阅读(182)
评论(0)
推荐(0)
摘要：
Lexicographicallyalgorithms:1. Iterate array from back to front, and find the first decreasing point: 1,2,4,3 -- 42. Iterate array from back to front,... 阅读全文
posted @ 2014-08-02 03:42
Tonix
阅读(142)
评论(0)
推荐(0)
摘要：
First I implemented it by QuickSort, but got a TLE:class Solution {public: struct Pair { Pair(ListNode *pS, ListNode *pE) : pStart(pS), p... 阅读全文
posted @ 2014-08-02 03:19
Tonix
阅读(147)
评论(0)
推荐(0)
浙公网安备 33010602011771号