搜狐2012.9.15校园招聘会笔试题

#include<iostream>
using namespace std;

void swap_int(int a , int b)
{
	int temp = a;
	a = b;
	b = temp;
}

void swap_str(char* a , char* b)
{
	char* temp = a;
	a = b;
	b = temp;
}

int main(void)
{
	int a = 10;
	int b = 5;
	char* str_a = "hello world";
	char* str_b = "world hello";
	swap_int(a , b);
	swap_str(str_a , str_b);
	printf("%d %d %s %s\n", a , b , str_a , str_b);

	return 0;
}

typedef struct object object;
struct object
{
	char data[3];
};

int main(void)
{
	object obj_array[3] = { {'a','b','c'},
	                        {'d','e','f'},
	                        {'g','h','i'} };
	object* cur =  obj_array;
	printf("%c %c\n", *(char*)((char *)(cur)+2) , *(char*)(cur+2));

	return 0;
}

char *string_a = (char *)malloc(100*sizeof(char));
char string_b[100];

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

// 返回新链表头节点
LinkNode *reverse_link(LinkNode *head)
{
	if(head == NULL)
		return NULL;
	LinkNode *prev , *curr , *reverse_head , *temp;
	prev = NULL , curr = head;
	while(curr->next)
	{
		temp = curr->next;
		curr->next = prev;
		prev = curr;
		curr = temp;
	}
	curr->next = prev;
	reverse_head = curr;
	return reverse_head;
}

LinkNode *reverse_link_recursive(LinkNode *head)
{
	if(head == NULL)
		return NULL;
	LinkNode *curr , *reverse_head , *temp;
	if(head->next == NULL)    // 链表中只有一个节点，逆转后的头指针不变
		return head;
	else
	{
		curr = head;
		temp = head->next;    // temp为(a2,...an)的头指针
		reverse_head = reverse_link_recursive(temp);   // 逆转链表(a2,...an),并返回逆转后的头指针
		temp->next = curr;    // 将a1链接在a2之后
		curr->next = NULL;
	}
	return reverse_head;      // (a2,...an)逆转链表的头指针即为(a1,a2,...an)逆转链表的头指针
}

int find_max_sum(int array[] , int n)
{
	int i , max , sum;
	sum = max = array[0];
	for(i = 1 ; i < n ; ++i)
	{
		if(sum < 0)
			sum = array[i];
		else
			sum += array[i];
		if(sum > max)
			max = sum;
	}
	if(max < 0)
		max = 0;
	return max;
}