CareerCup Given an array of (unsorted) integers, arrange them such that a 小于 b 大于 c 小于 d ... etc.

taoqick

于 2014-03-08 20:36:41 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 careercup

原文链接：https://blog.youkuaiyun.com/taoqick/article/details/105310050

算法同时被 2 个专栏收录

475 篇文章

订阅专栏

careercup

86 篇文章

订阅专栏

本文介绍了如何通过堆实现O(n)复杂度排列数组中元素的顺序，详细解释了算法步骤，并提供了错误示例和纠正。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an array of (unsorted) integers, arrange them such that a < b > c < d > e... etc.

---------------------------------------------------------------------------------

After using a heap, I found O(n) is enough...

private static void arrangeList(int A[]) {

	for (int i = 1; i < A.length; i++) {
	    if (i % 2 == 1 && A[i] < A[i - 1])
		swap(A, i, i - 1);
	    if (i % 2 == 0 && A[i] > A[i - 1])
		swap(A, i, i - 1);
	}
    }

    private static void swap(int[] a, int i, int j) {

	int temp = a[i];
	a[i] = a[j];
	a[j] = temp;
    }

The above solution isn't right. Go to https://blog.youkuaiyun.com/taoqick/article/details/105310050