408历年部分算法题

别的基本都复习完了，看一下算法。
写了四五年的不想写了，浪费时间，总之不行就暴力！

#include "bits/stdc++.h" 

using namespace std;

const int N = 10;
int a[N];
int a1[N];
int a2[N];

typedef struct Node{
	int data;
	struct Node *next;
}node;

typedef struct WordNode_2012{
	char c;
	struct WordNode_2012 *next;
}wnode;

void create(node *head) {
	node *st = head;
	for (int i = 0; i < N; i++) {
		node *newnode = new node;
		newnode->data = i + 1;
		st->next = newnode;
		st = st->next;
	}
	st->next = NULL;
	return;
}

void print(node *head) {
	node *st = head->next;
	while (st) {
		printf("%d ", st->data);
		st = st->next;
	}
	puts("");
	return;
}

void E_2009(node *head, int k) {
	node *p = head->next;
	for (int i = 0; i < k; i++) p = p->next;
	node *st = head->next;
	while (p) {
		p = p->next;
		st = st->next;
	}
	printf("%d", st->data);
}

void E_2010(int a[], int p){
	int b[N];
	int k = 0; //1 2 3 4 5 6 7 8 9 10
	for (int i = 0; i < p; i++) b[k++] = a[i];
	for (int i = p; i < N; i++) a[i - p] = a[i];
	k = 0;
	for (int i = 0; i < p; i++) a[N - p + i] = b[k++];
	for (int i = 0; i < N; i++) printf("%d ", a[i]); 
}

void E_2011(int a1[], int a2[]) {
	//Êý×éÒѾ­µÈ³¤ÇÒÓÐÐò£¬²»±ØÌÖÂÛ;Ö±½ÓË«Ö¸Õë·¨ 
	int idx1 = 0, idx2 = 0;
	for (int i = 0 ; i < N; i++) {
		if (a1[idx1] < a2[idx2]) idx1++;
		else idx2++;
	}
	printf("%d", max(a1[idx1], a2[idx2]));
} 

void E_2012() {
	//ºó׺×ÖĸÊýÏàͬ £¬ÓÃ2009ÄêµÄ¼¼ÇÉ
	//ÏȼÆÊý
	wnode *wl = new wnode;
	wl->c = 'l';
	wnode *wo = new wnode;
	wo->c = 'o';
	wnode *wa = new wnode;
	wa->c = 'a';
	wnode *wd = new wnode;
	wd->c = 'd';
	wnode *wb = new wnode;
	wb->c = 'b';
	wnode *we = new wnode;
	we->c = 'e';
	wnode *wi = new wnode;
	wi->c = 'i';
	wnode *wn = new wnode;
	wn->c = 'n';
	wnode *wg = new wnode;
	wg->c = 'g';
	
	wl->next = wo;
	wo->next = wa;
	wa->next = wd;
	wd->next = wi;
	wi->next = wn;
	wn->next = wg;
	wb->next = we;
	we->next = wi;
	wg->next = NULL;
	
	int longa = 0, longb = 0;
	wnode *head = wl;
	while (head) {
		longa ++;
		head = head->next;
	}
	head = wb;
	while (head) {
		longb ++;
		head = head->next;
	}
	
	wnode *pa = wl, *pb = wb;
	if (longa > longb)
		for (int i = 0; i < longa - longb ; i++) pa=pa->next;
	else for (int i = 0; i < longb - longa ; i++) pb=pb->next;
	
	while (pa != pb) {
		pa = pa->next;
		pb = pb->next;
	}
	
	printf("%c", pa->c);
	
}

void E_2013() {
	
}

int main() {
	//work();
	return 0;
}