-
Notifications
You must be signed in to change notification settings - Fork 0
/
lc905.c
74 lines (58 loc) · 1.17 KB
/
lc905.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
//将数组中偶数排在前,奇数排在后
#include<stdio.h>
#include<stdlib.h>
//原地排序
int* resort(int *arr, int len)
{
int i, j;
for(i = 0, j = 0; i < len && j < len; i++, j++)
{
while(arr[i] % 2 != 0 && i < len)//找到顺序第一个偶数下标
i++;
while(arr[j] % 2 == 0 && j < len)//找到顺序第一个奇数下标
j++;
if(i > j && i < len) //如果偶数下标大于奇数下标交换
{
arr[i] += arr[j];
arr[j] = arr[i] - arr[j];
arr[i] = arr[i] - arr[j];
}
}
return arr;
}
//非原地排序
int * resort1(int *arr, int len)
{
int ret[len];
int i, j, k = 0;
j = len;
for(i = 0; i < len; i++)
{
if(arr[i] % 2 == 0)
ret[k++] = arr[i];
else
ret[len-1-k] = arr[i];
}
for(i = 0; i < j; i++)
printf("%d ", ret[i]);
printf("\n");
return arr;
}
int main()
{
int len;
int i, j;
int *arr, *ret;
printf("input arr length:\n");
scanf("%d", &len);
arr = malloc(sizeof(int)*len);
ret = malloc(sizeof(int)*len);
printf("input arr val:\n");
for(i = 0; i < len; i++)
scanf("%d",&arr[i]);
// ret = resort(arr, len);
ret = resort1(arr, len);
for(i = 0; i < len; i++)
printf("%d ", arr[i]);
return 0;
}