taoqick的专栏

AtlantisTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17464 Accepted: 6654DescriptionThere are several ancient Greek texts that contain descriptions

Problem: s0 = "a", s1 = "b", s2 = "ba", s3 = "bab", s4 = "babba", s4 = "babbabab", is called Fibonacci string. For the string with index n, given a string str = "bb", calculate how many times in the

O(n) complexity, have a traversal for the tree. Get the information of all children, then traverse the tree again. #include #include #include #include using namespace std;class Node { pub

定义一个基类，用基类的指针分别指向不同的子类。。。#include #include #include #include using namespace std;class ListNode { public: int val; ListNode* next; ListNode(int x) : val(x), next(NULL) { }};

From  http://codercareer.blogspot.com/2011/12/no-27-area-of-rectangles.htmlNo. 27 - Area of RectanglesProblem: Please implement a function which gets area of a set of rectangles, whose edg

Problem:Give a series of IP segments, for example, [0.0.0.1-0.0.0.3], [123.234.232.21-123.245.21.1]...Now there is a new IP, find which IP segment it's in ?Solution:First, we could map the end

#includeusing namespace std;class A { public: char ch[1]; virtual void fun() { }};class B: virtual public A { public: char ch[1]; virtual void fun() { }};class C: virtual publ

此类题目要明确两点：1. 打表：用数组下标索引字符，同时注意如果从字符对应回数字： int index = (str[i] >= '0' && str[i] 2. 注意低位在前还是高位在前，如果先来的是 低位*radix^i 即可。3. 统计每几个radix进制数组成一位，利用bits来表示。。。这破题主要是麻烦。。。#include #includ