dark19940411的专栏

Problem Statement  You work for an electric company, and the power goes out in a rather large apartment complex with a lot of irate tenants. You isolate the problem to a network of sewers

Problem Statement    Let's say you have a binary string such as the following:011100011One way to encrypt this string is to add to each digit the sum of its adjacent digits. For example, the a

#include#include#include#include#includeusing namespace std;#define MAX 1000int father[MAX], son[MAX];int v, l;typedef struct Kruskal //存储边的信息{ int a; int b; int value;};bool cmp(cons

这一篇博客主要是与状态篇形成互补。主要记下一些面试中的题目，并给出题解。 作者注：所有的题目都只给出思考方法，不给出代码。笔试：Q：给出一篇英语文章，并统计里面每个单词的出现次数。A：这题，我用OC给出了一个解法。就是用字典，中的key为单词名，value为单词出现的次数，通篇扫描一次文章，那么字典里就存了每个单词出现的次数。 这是个可行的办法，但是这样子呢，就使用了苹果的库里