数组右旋操作 以及 合并两个有序数组

1.数组右旋,k表示次数;

void rotate(int* nums, int numsSize, int k) {
	int newArr[1024];//引进一个新数组来保存旋转后的数组
	for (int i = 0; i < numsSize; ++i) {
		newArr[(i + k) % numsSize] = nums[i];
	}
	for (int i = 0; i < numsSize; ++i) {
		nums[i] = newArr[i];
	}
}
int main() {
	int a[] = { 1,2,3,-10,-1,6,7 };
	rotate(a, 7, 2);
	for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++) {
	printf("%d ", a[i]);
	}
	system("pause");
	return 0;
}

2.初始化两个数组nums1和nums2,它们的元素数量分别为m和n.

合并两个有序数组nums1和nums2,合并后的数组也为有序数组有序数组,并且让合并的大小等于m+n.

例如输入:

nums1 = [1,2,3,4,5,6], m = 3.

nums2 = [2,3,5,9], n = 3.

输出：[1,2,2,3,3,5];

 

void sort(int* num1, int m, int* num2, int n) {
	int p1 = m - 1, p2 = n - 1;
	int tail = m + n - 1;
	int cur;
	while (p1 >= 0 || p2 >= 0) {
		if (p1 == -1) {
			cur = num2[p2--];
		}
		else if (p2 == -1) {
			cur = num1[p1--];
		}
		else if (num1[p1] > num2[p2]) {
			cur = num1[p1--];
		}
		else {
			cur = num2[p2--];
		}
		num1[tail--] = cur;
	}
}

int main() {
	int a[] = { 1,2,3,4,5,6 };
	int b[] = { 2,3,5,9};
	int m = 3;
	int n = 3;
	sort(a, m, b, n);
	for (int i = 0; i < m + n; i++) {
		printf("%d ", a[i]);
	}
	system("pause");
	return 0;
}