算法题练习(指针)

算法题练习

1. 将数组a中比第一个元素小的元素平移到第一个元素之前

#include<stdio.h>
int main(void)
{
	int a[] = {6, 2, 5, 8, 4, 7};
	int len = sizeof(a) / sizeof(a[0]);
	int first = a[0];
	for(int i=0; i<len; ++i){
		if ( first > a[i] ){
			int wait = a[i];
			for(int j=i; j>0; --j){
				a[j] = a[j-1];
			}
			a[0] = wait;
		}
	}
	
	for( int i=0; i<len; ++i){
		printf("%3d", a[i]);
	}
	return 0;
 } 

2. 将所有奇数移至偶数之前

#include <stdio.h>
int getodd( int a[], int len );
int geteven( int a[], int len );
void swap( int a[], int left, int right );
int main( void )
{
	int a[] = {3, 2, 5, 8, 4, 7};
	int len = sizeof(a) / sizeof(a[0]);
	int left, right;
	while(left<right){
		left = geteven(a, len);
		right = getodd(a, len);	
		if( left < right ){
			swap( a, left, right );
		}
	}
	
	for( int i=0; i<len; ++i){
		printf("%3d", a[i]);
	}	
	return 0;
}

int getodd( int a[], int len) {
	for( int i=len-1; i>=0; --i ){
		if( a[i]%2 != 0 ){
			return i;
		}
	} 
}

int geteven( int a[], int len) {
	for( int i=0; i<len; ++i ){
		if( a[i]%2 == 0 ){
			return i;
		}
	} 
}

void swap( int a[], int left, int right ){
	int temp = a[left];
	a[left] = a[right];
	a[right] = temp;
}

3. 将数组a从中间一分为二，将前半段与后半段按顺序交换

方法一：区分奇偶

#include <stdio.h>
void exchange ( int a[], int len);
int main(void)
{
	//int a[] = {3, 2, 5, 8, 4, 7, 6, 9};
	int a[] = {3, 2, 5, 8, -1, 4, 7, 6, 9};
	int len = sizeof(a) / sizeof(a[0]);
	exchange(a, len);
	for( int i=0; i<len; ++i){
		printf("%3d", a[i]);
	}	
 } 
 
void exchange ( int a[], int len){
	for( int i=0; i<len/2; i++){
		if( len%2 == 0 ){
			int temp = a[i];		
			a[i] = a[len/2 + i];	
			a[len/2 + i] = temp;
		}
		else{
			int temp = a[i];
			i[a] = a[len/2+i+1];
			a[len/2+i+1] = temp;
		}		
	}
}

方法二：不用区分奇偶，找前半段的起始与结束下标，与后半段的起始与结束下标

#include <stdio.h>
void exchange ( int a[], int len);
int main(void)
{
	//int a[] = {3, 2, 5, 8, 4, 7, 6, 9};
	int a[] = {3, 2, 5, 8, -1, 4, 7, 6, 9};
	int len = sizeof(a) / sizeof(a[0]);
	exchange(a, len);
	for( int i=0; i<len; ++i){
		printf("%3d", a[i]);
	}	
 } 
 
void exchange ( int a[], int len){
	int t = (len + 1) / 2;/*统一奇偶，精辟，nb*/
	for(int i=0; i<len/2; ++i){
		int temp = a[i];
		a[i] = a[t + i];
		a[t + i] = temp;
	} 
}

方法三：不用区分奇偶，不用找后半段的的起始值。 令 i=n/2-1， j=n-1; 让 i 减到-1即可

#include <stdio.h>
void exchange ( int a[], int len);
int main(void)
{
	//int a[] = {3, 2, 5, 8, 4, 7, 6, 9};
	int a[] = {3, 2, 5, 8, -1, 4, 7, 6, 9};
	int len = sizeof(a) / sizeof(a[0]);
	exchange(a, len);
	for( int i=0; i<len; ++i){
		printf("%3d", a[i]);
	}	
 } 
 
void exchange ( int a[], int len){
	int i, j;
	for(i=len/2-1,j=len-1; i>-1; i--,j--){
		int temp = a[i];
		a[i] = a[j];
		a[j] = temp;
	} 
}

方法四：i, j 之间的距离是固定的

#include <stdio.h>
void exchange ( int a[], int len);
int main(void)
{
	//int a[] = {3, 2, 5, 8, 4, 7, 6, 9};
	int a[] = {3, 2, 5, 8, -1, 4, 7, 6, 9};
	int len = sizeof(a) / sizeof(a[0]);
	exchange(a, len);
	for( int i=0; i<len; ++i){
		printf("%3d", a[i]);
	}	
 } 
 
void exchange ( int a[], int len){
	int t = (len + 1) / 2;/*统一奇偶，精辟，nb*/
	for(int i=0; i<len/2; ++i){
		int temp = a[0];
		a[0] = a[t];
		a[t] = temp;
		a++;/*直接将指针向后移动，i和j之间的长度不变*/
	} 
}