随笔分类 - Array
摘要:link class Solution { public: bool isTransformable(string s, string t) { vector<deque<int>> pos(10); for(int i=0;i<s.size();i++){ pos[s[i]-'0'].push_b
阅读全文
摘要:link prove: @interviewrecipes https://leetcode.com/problems/minimum-swaps-to-arrange-a-binary-grid/discuss/768076/Min-Adjacent-Swaps-to-Sort-the-array
阅读全文
摘要:Link class Solution { public: void sortColors(vector<int>& nums) { int low=0; int high=nums.size()-1; for(int i=0;i<=high;){ if(nums[i]==0){ swap(nums
阅读全文

浙公网安备 33010602011771号