
C语言数组去除重复内容
#defineSIZE12inta[SIZE]={0,0,0,1,2,2,3,4,4,5,5,44};假设数组已经从小到大排好序,去除重复的内容输出0,1,2,3,4,5...
#define SIZE 12
int a[SIZE] = {0,0,0,1,2,2,3,4,4,5,5,44};
假设数组已经从小到大排好序,去除重复的内容 输出0,1,2,3,4,5,44。
不要用再创建一个数组保存的方法,我想知道怎么直接在原数组去除。 展开
int a[SIZE] = {0,0,0,1,2,2,3,4,4,5,5,44};
假设数组已经从小到大排好序,去除重复的内容 输出0,1,2,3,4,5,44。
不要用再创建一个数组保存的方法,我想知道怎么直接在原数组去除。 展开
展开全部
#include <stdio.h> // 升序数组srcvoid sort(int *src, int len){ int tem; for (int i = 0; i < len; i++) { for (int j = 0; j < len - i - 1; j++) if (src[j] > src[j+1]) { tem = src[j]; src[j] = src[j+1]; src[j+1] = tem; } }} int main(){ int num[10] = {0, 2, 5, 1, 1, 5, 4, 9, 2, 1}, d; int i = 0, cnt; sort(num, 10); // 排序 d = num[0]; for (i = 1; i < 10; i++) // 遍历比较 { if (num[i] != d) { printf("%d ", d); d = num[i]; } } if (num[9] == d) printf("%d\n", d); return 0;}
展开全部
用两个游标控制,可以方便的实现,参考代码如下:
#include<stdio.h>
#define SIZE 12
int a[SIZE]={0,0,0,1,2,2,3,4,4,5,5,44};
int main()
{
int i=1,j=0;
while(i<SIZE)
if(a[j]!=a[i]){
++j;
a[j]=a[i];
++i;
} else ++i;
for(i=0;i<=j;++i){
printf("%d",a[i]);
if(i<j)printf(",");
}
return 0;
}
#include<stdio.h>
#define SIZE 12
int a[SIZE]={0,0,0,1,2,2,3,4,4,5,5,44};
int main()
{
int i=1,j=0;
while(i<SIZE)
if(a[j]!=a[i]){
++j;
a[j]=a[i];
++i;
} else ++i;
for(i=0;i<=j;++i){
printf("%d",a[i]);
if(i<j)printf(",");
}
return 0;
}
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
展开全部
#include<stdio.h>
#define SIZE 12
main() {
int a[SIZE] = { 0,0,0,1,2,2,3,4,4,5,5,44 };
int count = 1;
int i = 0;
for (i = 1; i < SIZE; i++) {
if (a[i] != a[count - 1]) {
a[count++] = a[i];
}
}
if (count > SIZE) count--;
for (i = 0; i < count; i++) {
printf("%d ", a[i]);
}
}
#define SIZE 12
main() {
int a[SIZE] = { 0,0,0,1,2,2,3,4,4,5,5,44 };
int count = 1;
int i = 0;
for (i = 1; i < SIZE; i++) {
if (a[i] != a[count - 1]) {
a[count++] = a[i];
}
}
if (count > SIZE) count--;
for (i = 0; i < count; i++) {
printf("%d ", a[i]);
}
}
本回答被提问者采纳
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询