摘要: c++最终版 class Solution {public: int firstMissingPositive(vector<int>& nums) { int n = nums.size(); for (int i = 0; i < n; i++) while (nums[i] > 0 && nu 阅读全文
posted @ 2017-06-12 01:19 bloomingFlower 阅读(112) 评论(0) 推荐(0) 编辑