[閒聊] 炮灰Day1 程式設計概要

作者: chrisdar (克里斯) 看板: Examination
標題: [閒聊] 炮灰Day1 程式設計概要
時間: Wed Jul 14 21:00:35 2010

#include 
#include 
#include 
using namespace std;

int most_significant_bit_set_bit(int num) {
    int r = -1;
    for (; num >>= 1;) {
        r++;
    }
    return r;
}

int string_search(char str[], char pat[]) {
    for (int i = 0; str[i] != 0; ++i) {
        int j = 0, k = 0;
        for (; pat[j] != 0; ++j) {
            k += (str[i+j] == pat[j] ? 1 : 0);
        }
        if (j == k) {
            return i;
        }
    }
    return -1;
}

typedef struct node {
    int d;
    struct node *next;
} node;

void split(node *h, node **h1, node **h2) {
    node *h1w = 0, *h2w = 0;
    for (; h != 0; h = h->next) {
        if (((h->d) & 1) == 1) {
            (h1w == 0 ? *h1 = h1w = h : h1w->next = h), h1w = h;
        } else {
            (h2w == 0 ? *h2 = h2w = h : h2w->next = h), h2w = h;
        }
    }
    h1w->next = 0, h2w->next = 0;
}

int main(int argc, char* argv[]) {
    srand((unsigned)time(0));
    int v = rand();
    cout << bitset<32>(v) << endl;
    cout << most_significant_bit_set_bit(v) << endl << endl;

    char str[] = "strin";
    char pat[] = "ing";
    cout << str << endl;
    cout << pat << endl;
    cout << string_search(str, pat) << endl << endl;


    node data[] = {{3}, {4}, {5}, {7}, {8}};
    for (int i = 0; i < 4; ++i) {
        data[i].next = &data[i+1];
    }
    for (node *h = data; h != 0; h = h->next) {
        cout << h << " - " << h->d << " - " << h->next << endl;
    }
    node *h = data, *h1 = 0, *h2 = 0;
    split(h, &h1, &h2);
    cout << "