有序数组的去重,超简单的方法
//=======================================
//*author: ABNQ
//*email:abnq_cn@qq.com
//*create time :2020-05-15 14:09
//*filename:test.c
//*description:有序数组排序
//========================================
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main( )
{
int a[] = {1,1,1,1,1,1,1,1,1,2,2,3,3,3,3,4}, b[] = {0};
int i, len, j = 1;
len = sizeof(a) / sizeof(a[0]);
for( i = 1; i < len; i++)
{
if( a[i] != a[j - 1])
{
a[j++] = a[i];
}
}
for ( i = 0; i < j; i++)
{
printf("%d\n",a[i]);
}
}