Rearrange an array of positive and negative integers

Given an array of positive and negative integers, re-arrange it
so that you have postives on one end and negatives on the other,
BUT retain the original order of appearance.

For eg. 1, 7, -5, 9, -12, 15 => -5, -12, 1, 7, 9, 15

可以使用块交换技术实现题目要求，

1,7，-5 交换为 -5,1,7

然后

-5,1,7,9,-12 交换为 -5,-12,1,7,9

目测时间复杂度是o(n^2)

但是可以用递归将时间复杂度降维nlogn

http://haixiaoyang.wordpress.com/?s=Rearrange

有空可以研究下

//Given an array of positive and negative integers,
//re-arrange it so that you have postives on one end
//and negatives on the other, BUT retain the original order of appearance. do it in-place
//e.g. 1, 7, -5, 9, -12, 15 => -5, -12, 1, 7, 9, 15//When considering optimization from O(n^2) to O(nlogn),use divided & conquer
void swapRange(int a[], int nBeg, int nEnd)
{assert(a && nBeg <= nEnd);while (nBeg < nEnd)swap(a[nBeg++], a[nEnd--]);
}//solution:
//e.g. in any stage: ---- "+++ --" ++++, reverse middle part
// ==> ---- "--" "+++" ++++, reverse middle 2 parts seperatly to keep "stable"
void ReArrange(int a[], int n)
{assert(a && n > 0);if (n <= 1) return;ReArrange(a, n/2);ReArrange(a + n/2, n - n/2); //pitfall, notice both parametersint nLft = 0;while (a[nLft] < 0) nLft++;int nRgt = n-1;while (a[nRgt] >= 0)nRgt--;//Very important, no need to swap under this situation, returnif (nRgt <= nLft) return; swapRange(a, nLft, nRgt);int nBegRgt = nLft;while (a[nBegRgt] < 0) //no need to use "&& nBegRgt < n"nBegRgt++;swapRange(a, nLft, nBegRgt-1);swapRange(a, nBegRgt, nRgt);
}

Rearrange an array of positive and negative integers相关推荐

Linux交叉编译问题strace解决 signalfd.c:15: xlat/sfd_flags.h:17: error: size of array 'type name' is negative
产品不是很稳定,执行shell容易出现段错误,为了定位打算移植strace到嵌入式板子上,环境是MIPS平台,从github上下载的strace源码,编译ARM平台通过( ubuntu 12.04 交 ...
【雅思大作文考官范文】——第十二篇：'positive or negative' essay
题目: Some universities now offer their courses on the Internet so that people can study online. Is th ...
使用XGBClassifier出现Dataset is empty, or contains only positive or negative samples.错误
问题: 之前在lightgbm中使用了早停early_stopping参数,于是我也想在xgboost中使用类似的方法进行早停,从其他地方找到的代码大致都是这样写的: from xgboost imp ...
4kyu Sum by Factors
4kyu Sum by Factors 题目背景: Given an array of positive or negative integers I= [i1,-,in] you have to p ...
hdu 1081To The Max
http://acm.hdu.edu.cn/showproblem.php?pid=1081 题意:求子矩阵的和的最大值思路:把多维转化为一维,只要会一维的就简单了... To The Max Ti ...
Maximum Sum UVA - 108（连续子序列最大和—变形之子矩阵最大和）
题目大意:给出 n*n 的矩阵,找每隔数字之和最大的子矩阵,输出最大和. 解题思路:枚举矩阵左上和右下的坐标,分别合并子矩阵的每列,使得二维转化为一维,然后利用连续子序列最大和去做就行. Time ...
【POJ - 1050】To the Max （dp）
题干: Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguo ...
java 打印不换行_Swift的print不换行打印的方法
github上写blog http://www.elbow95.me/blog/My-First-Blog-Essay.html 阮一峰的: http://www.ruanyifeng.com/blo ...
POJ1050-To the Max
描述: Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguo ...

Rearrange an array of positive and negative integers

Rearrange an array of positive and negative integers相关推荐

最新文章

热门文章