LintCode:M-Partition Array(快排变种)
LintCode:Link
Given an array nums of
integers and an int k, partition the array (i.e move the elements
in "nums") such that:
All elements k are moved to the leftAll elements >= k are moved
原创
2017-08-24 22:01:45 ·
263 阅读 ·
0 评论