当前位置:网站首页>C language: adjust the order of odd and even numbers
C language: adjust the order of odd and even numbers
2022-08-09 07:45:00 【Gaoyou Wu Shao】
输入一个整数数组,实现一个函数,来调整该数组中数字的顺序
to make all odd numbers in the array in the first half of the array.所有的偶数位于数组的后半部分.
比如现在有数组arr: 1 2 3 4 5 6
思路1:The first thought of most students may be this,把数组arr遍历一遍,Find the odd number of them,放到新数组arr1中
再把arr遍历一遍,Find the even numbers among them,放到数组arr2中.
最后把arr1the sum ofarr2Put the numbers back inarr中.
But this method you have to traverse from beginning to end3次arr,The time complexity is large,Pure violence
思路2:We can define oneleft和rightMark the first element of the array and the last element of the array, respectively
leftStop on an even number,否则left++
rightStop at odd numbers,否则right–
交换left和right下标的值
left继续++,Stop on an even number
right继续–,Stop at odd numbers
然后left和right交换
…
循环一直到left>=right时结束
这样,We only need to iterate over the array oncearrYou can achieve odd numbers first,The even numbers are next
具体代码如下:
int main()
{
int n = 0;
int arr[100] = {
0 };//This assumes that the array size does not exceed100
printf("Please enter the size of the array you want to test:");
scanf("%d", &n);
printf("请输入数组元素:");
for (int i = 0;i < n;i++)
{
scanf("%d", &arr[i]);
}
int left = 0;
int right = n-1;
while (left < right)
{
while (arr[left] % 2 != 0)//leftStop on an even number
{
left++;
}
if (left >= right)//Avoid encountering all odd cases,If all odd numbers are encountered,没有这个if,left会越界
{
break;
//这里直接left一路走,已经比right大了,就可以直接跳出循环,No need to go any further
}
while (arr[right] % 2 != 1)//rightStop at odd numbers
{
right--;
}
if (left < right)//An additional judgment is required hereleft<right
{
//比如 1 2 3 4 5 6 7 8 9 10
//已经变成了1 9 3 4 5 6 7 8 2 10
//left指向4,right指向了7,两者交换
//得到 1 9 3 7 5 6 4 8 2 10
//此时的left还是小于right的,So you can still enter the next cycle
//But the last loopleft指向了6,right指向了5,这时就要ifJudge it and interrupt the exchange
int tmp = arr[left];
arr[left] = arr[right];
arr[right] = tmp;
}
}
printf("\n");
for (int i = 0;i < n;i++)
{
printf("%d ", arr[i]);
}
return 0;
}
测试1:
测试2:
边栏推荐
猜你喜欢
MYSQLWorkbench看数据库ER图
排序第一节——插入排序(直接插入排序+希尔排序)(视频讲解26分钟)
Four departments including the Ministry of Industry and Information Technology promote green smart home products to the countryside
(error) NOAUTH Authentication required.
Oracle 限制时将空值排除
unity第一课
解决pycharm每次新建项目都要重新pip安装一些第三方库等问题
SiamFC:用于目标跟踪的全卷积孪生网络 fully-convolutional siamese networks for object tracking
SAP ALV data export many of the bugs
74HC595芯片引脚说明
随机推荐
list and string conversion
链表专项练习(三)
C语言:调整奇数偶数顺序
排序第四节——归并排序(附有自己的视频讲解)
VOC format label to YOLO format
2022 年全球十大最佳自动化测试工具
重要消息丨.NET Core 3.1 将于今年12月13日结束支持
原生JDBC操作数据库
Record a failure to upgrade the client's APP database version number
4.MySQL更新和删除数据
Anaconda 使用代理
【机器学习】降维代码练习
Lottie系列三 :原理分析
SSL证书最长有效期13个月,还有必要一次申请多年吗?
RestFul,会话技术,Fiddler
ImportError: cannot import name ‘imresize‘
环形链表问题(判环、求入口点)
jmeter并发数量以及压力机的一些限制
es6 基础知识详解 变量 字符串 解构赋值 函数 对象 从入门到精通
Native JDBC operation database