对n个关键字取整数的记录进行整序，以使所有关键字为非负整数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（n）。-N keyword to check the records of the entire integer sequence, so that all non-negative integer keyword records in the records of negative keywords, before at least require the use of additional space, and the algorithm time complexity is O ( n).