1 顺序表删除最小值,然后将末尾值填充到空位.
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
void delMin(int* arr, int len) {
int min = *arr;
int pos = 0;//记录最小值位置
if (!len) {
printf("数组为空!");
exit(-1);
}
for (int i = 1; i < len; i++) {
if (min > *(arr + i)) {
min = *(arr + i);
pos = i;
}
}
*(arr + pos) = *(arr + len - 1);
*(arr + len - 1) = NULL;
}
int main() {
int len;
printf("请输入创建数组的长度: ");
scanf("%d", &len);
int* arr = (int*)malloc(sizeof(int) * len);
printf("\n请输入数组的元素值:");
for (int i = 0; i < len; i++) {
scanf("%d", (arr + i));
}
delMin(arr, len);
printf("打印更新后的数组:\n");
for (int i = 0; i < len-1; i++) {//此处数组元素值减少一个
printf("%d ", *(arr + i));
}
}
2.顺序表原地逆置
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
void reverseS(int* arr, int len) {
int tmp;
for (int i = 0; i < len/2; i++) {//只能循环一半,不然又换回原来的了
tmp = *(arr + i);
*(arr + i) = *(arr + len - i - 1);
*(arr + len - i - 1) = tmp;
}
}
int main() {
int len;
printf("请输入数组长度:");
scanf("%d", &len);
int* arr = (int*)malloc(sizeof(int) * len);
printf("请输入数组元素的值:");
for (int i = 0; i < len; i++) {
scanf("%d", arr + i);
}
for (int i = 0; i < len; i++) {
printf("%d ", *(arr + i));
}
reverseS(arr, len);
printf("\n输出逆置后的数组元素:\n");
for (int i = 0; i < len; i++) {
printf("%d ", *(arr + i));
}
return 0;
}
3.顺序表删除指定元素x的值
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
int delX(int* arr, int n, int x) {
int k = 0;
for (int i = 0; i < n; i++) {
if (*(arr + i) == x) {
k++;
}
else {
*(arr + i - k) = *(arr + i);
}
}
for (int i = n - k; i < n; n++) {
*(arr + i) = NULL;
}
return k;
}
int main() {
int arr[] = { 1,2,3,2,2,3,3,3,2,4 };
int n = sizeof(arr) / sizeof(int);
for (int i = 0; i < n; i++) {
printf("%d ", *(arr + i));
}
int k=delX(arr, n, 2);//删除2
printf("\n输出删除后的数组元素值:\n");
for (int i = 0; i < n-k; i++) {
printf("%d ", *(arr + i));
}
return 0;
}
4.顺序表删除给定区域的值
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
void delArea(int *arr,int len,int s,int t) {
int i, k;
for ( i = 0; i < len && *(arr + i) <= s; i++);
if (i >= len)
return;
for ( k = i; k < len && *(arr + k) <= t; k++);
for (; k < len; k++, i++)
*(arr + i) = *(arr + k);
for (int j = 0; j < i; j++)
printf("%d ", *(arr + j));
}
int main() {
int arr[] = { 1,2,5,5,12,15 };
int len = sizeof(arr) / sizeof(int);
int s, t;
printf("s= ");
scanf("%d", &s);
printf("t= ");
scanf("%d", &t);
delArea(arr, len, s, t);
return 0;
}
5.删除有序表中重复元素
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int deleteRe(int* arr, int len) {
int k = 0;
for (int i = 0; i < len-1; i++) {
if (*(arr + i) - *(arr + i + 1))
*(arr + k++) = *(arr + i);
}
*(arr + k++) = *(arr + len - 1);
//最后一个值不管与前一个值是否相等,都直接赋值,因为最后两个值如果相等,
//在上一步两个值都没有被赋值,如果不等,则最后一个值没有被赋值
return k;
}
int main() {
int arr[] = { 1,2,2,3,3,4,5,5,5 };
int len = sizeof(arr) / sizeof(int);
int k = deleteRe(arr, len);
for (int i = 0; i < k; i++)
printf("%d ", *(arr + i));
/*int i = 1;
int b = 3;
int c = b + i++;
printf("c=%d,i=%d", c,i);*/
return 0;
}
6.合并有序表
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
int *mergLi(int* arr1, int* arr2, int len1, int len2) {
int i, j,k=0;
int* newArr = (int*)malloc(sizeof(int) * (len1 + len2));
for (i = 0, j = 0; i < len1 && j < len2;) {
*(arr1 + i) < * (arr2 + j) ? *(newArr + k++) = *(arr1 + i++) : *(newArr + k++) = *(arr2 + j++);
}
while (i < len1) {
*(newArr + k++) = *(arr1 + i++);
}
while (j < len2) {
*(newArr + k++) = *(arr2 + j++);
}
return newArr;
}
int main() {
int arr1[] = { 0,1,2,3,3,5 };
int arr2[] = { 2,4,6,8,8,99 };
int len1 = sizeof(arr1) / sizeof(int);
int len2 = sizeof(arr2) / sizeof(int);
int* newArr;
newArr=mergLi(arr1, arr2, len1, len2);
for (int i = 0; i < len1 + len2; i++)
printf("%d ", *(newArr+i));
}
7.交换两个数组位置
#include<stdio.h>
void reverse(int* arr, int start, int end) {
int tmp;
for (int i = start; i <= (start+end) / 2; i++) {
tmp = *(arr + i);
*(arr + i) = *(arr + end +start -i);
*(arr + end +start -i) = tmp;
}
}
void exchange(int* arr, int m, int n) {
reverse(arr, 0, m+n-1);
reverse(arr, 0, n-1);
reverse(arr, n, m + n - 1);
}
int main() {
int arr[10] = { 1,2,3,4,5,6,7,8,9,10 };
//reverse(arr, 0, 9);
//reverse(arr, 0, 4);
//reverse(arr, 5, 9);
exchange(arr, 5, 5);
for (int i = 0; i < 10; i++)
printf("%d ", *(arr + i));
return 0;
}
8.折半查找
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int halfFind(int* arr, int len, int x) {
int mid;
int low = 0, high = len - 1;
while (low <= high) {
mid = (low + high) / 2;
if (x == *(arr + mid))
break;
if (x > *(arr + mid))
low = mid + 1;
else
high = high - 1;
}
if (low > high) {
for (int i = len; i > high; i--)
*(arr + i) = *(arr + i - 1);
*(arr + high+1) = x;
return len + 1;
}
else {
int tmp = *(arr + mid);
*(arr + mid) = *(arr + mid + 1);
*(arr + mid + 1) = tmp;
return len;
}
}
int main() {
int arr[10] = { 1,2,3,4,6,6,7,8 };
int x;
printf("请输入要查找的元素: ");
scanf("%d", &x);
int relen=halfFind(arr, 8, x);
for (int i = 0; i < relen; i++)
printf("%d ", *(arr + i));
return 0;
}
9.循环左移
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
void reverse(int* arr, int p, int len) {
int tmp;
for (int i = 0; i < len/2; i++) {
tmp = *(arr + i);
*(arr + i) = *(arr + len-1 - i);
*(arr + len-1 - i) = tmp;
}
for (int i = 0; i < (len - p)/2; i++) {
tmp = *(arr + i);
*(arr + i) = *(arr + len-p - 1 - i);
*(arr + len-p - 1 - i) = tmp;
}
for (int i = 0; i < p / 2;i++) {
tmp = *(arr +len-1- i);
*(arr + len - 1 - i) = *(arr + len - p + i);
*(arr + len - p + i) = tmp;
}
}
int main() {
int arr[7] = { 1,2,3,4,5,6 ,7};
reverse(arr, 2, 7);
for(int i=0;i<7;i++)
printf("%d ", *(arr + i));
return 0;
}
10.寻找两个等长升序序列的中位数
//2022-11-01
#include<stdio.h>
int findMid(int* arr1, int* arr2, int len) {
int mid,count=0;
for (int i = 0, j = 0; *(arr1 + i) && *(arr2 + j);) {
if (++count == len) {//注意偶数个序列时,中位数左边比右边少一个
mid = *(arr1 + i) < *(arr2 + j) ? *(arr1 + i) : *(arr2 + j);
break;
}
else
*(arr1 + i) < *(arr2 + j) ? i++ : j++;
}
return mid;
}
int main() {
int arr1[] = { 1,3,5,7,9 };
int arr2[] = { 2,4,6,8,10 };
//1 2 3 4 5 6 7 8 9 10
int len = sizeof(arr1) / sizeof(int);
int mid = findMid(arr1, arr2, len);
printf("mid=%d\n", mid);
/*int count = 2;
if (count++ == 2)
printf("1");
else
printf("0");*/
return 0;
}
11.寻找主元素
//2022-11-07
#include<stdio.h>
int findMain(int* arr, int len) {
int count=1;
int c = *arr;
int Main = 1;
int mainNum=0;
for (int i = 1; i < len; i++) {
if (*(arr + i) == c)
count++;
else {
if (count > 0)
count--;
else{
c = *(arr + i);
count=1;
}
}
}
for (int i = 0; i < len; i++) {
if (*(arr + i) == c)
mainNum++;
}
if (mainNum > len / 2)
return c;
else
return -1;
}
int main() {
int arr[] = { 0,5,5,3,5,7,5,5 };
//int arr[] = { 0,5,5,3,5,7,5,1 };
printf("%d\n",findMain(arr, 8));
return 0;
}
12.寻找最小未出现的正整数
//2022-11-07,寻找数组中最小未出现的正整数
#include<stdio.h>
#include<stdlib.h>
int findMin(int* arr, int len) {
int* arrB = (int*)malloc(sizeof(int) * len);
for (int i = 0; i < len; i++) {
arr[i]>0?arrB[arr[i] - 1] = 1: arrB[i] = 0;
//printf("arr[%d]=%d\n", i,arr[i]);
//printf("arr[%d] - 1=%d arrB[arr[%d] - 1]=%d\n\n",i, arr[i] - 1,i, arrB[arr[i] - 1]);
}
/*for (int i = 0; i < len; i++)
printf("arrB[%d]=%d ", i, arrB[i]);*/
for (int k = 0; k < len; k++)
if (arrB[k]!= 1)//应写成arrB[k]!= 1,如果写成arr[k]==0,则当arr数组元素不连续时就会出现不符合预期的值
return k + 1;//遍历完成前找到最小元素
return len + 1;//数组元素连续时返回的最小元素,这条语句是否添加对于连续数组返回的值有时对有时错,错可以理解,但对是为什么呢?这值得思考
}
int main() {
//int arr[] = { 0,-1,1,2,33,4,5 };
int arr[] = {2,1,3,4,5,6};
int len = sizeof(arr) / sizeof(int);
int re = findMin(arr, len);
printf("\n\n%d\n", re);
//return 0;
}
//#include<stdio.h>
//int f(int n){
// if (n > 5)
// return 5;
//}
//int main() {
// int a = f(3);
// printf("a=%d", a);
// return 0;
// }
13.三元组最小距离
///* 2022-11-08
// 已知三个升序整数数组a[l], b[m]和c[n]。请在三个数组中各找一个元素,是的组成的三元组距离最小。三元组的距离定义是:假设a[i]、b[j]和c[k]是一个三元组,那么距离为:
//
// Distance = max(|a[ I ] – b[ j ]|, |a[ I ] – c[ k ]|, |b[ j ] – c[ k ]|)
//
// 请设计一个求最小三元组距离的最优算法,并分析时间复杂度。
//*/
#include<stdio.h>
#include<math.h>
int dis(int a,int b,int c){
return abs(a - b) + abs(a - c) + abs(b - c);
}
int min(int a, int b, int c) {
if (a < b && a < c)return a;
else if (b < a && b < c)return b;
else return c;
}
int findMinTrip(int* s1, int* s2, int* s3, int len1, int len2, int len3) {
int i = 0, j = 0, k = 0;
int minD = 9999;
int nowD = 0;
while (i < len1 && j < len2 && k < len3) {
nowD = dis(s1[i], s2[j],s3[k]);
if (nowD < minD)minD = nowD;
if (s1[i] == min(s1[i], s2[j], s3[k])) i++;//最小值下标往后移动
else if (s2[j] == min(s1[i], s2[j], s3[k]))j++;
else k++;
}
return minD;
}
int main() {
int S1[] = { -1,0,3,9 };
int S2[] = { -25,-10,3,10,11 };
int S3[] = {2,3,9,17,30,41};
int minD = findMinTrip(S1,S2,S3,4,5,6);
return 0;
}