2022.7.20

最新推荐文章于 2024-07-18 08:54:18 发布

0x0c……

最新推荐文章于 2024-07-18 08:54:18 发布

阅读量35

点赞数

本文链接：https://blog.csdn.net/qq_60559011/article/details/125897867

版权

整数替换字符串交换数组范围算法编程技巧

关键词由CSDN通过智能技术生成

class Solution {
public:
    int integerReplacement(int n) {
       int ans = 0;
        while (n != 1) {
            if (n % 2 == 0) {
                ++ans;
                n /= 2;
            }
            else if (n % 4 == 1) {
                ans += 2;
                n /= 2;
            }
            else {
                if (n == 3) {
                    ans += 2;
                    n = 1;
                }
                else {
                    ans += 2;
                    n = n / 2 + 1;
                }
            }
        }
        return ans;
    }
};

在这里插入图片描述

class Solution {
public:
   
    static char cmp(char a , char b){  //辅助将string从大到小排序
        return a>b;
    }
    int maximumSwap(int num) {
        string change = to_string(num);
        string exchange = change;
        sort(exchange.begin(),exchange.end(),cmp);
    
        char small = ' ';    
        char big = ' ';
        for(int i = 0 ; i< change.size(); i++){
            if(exchange[i] != change [i]) { 
                small = change[i];
                big = exchange[i];
                change[i]= exchange[i];
                break;
            }
        }
        for(int i = change.size()-1 ; i >=0; i--){
          if(small!= ' ' && change[i] == big) {
                change[i] =small;
                break;
            }
        }

        int res = stoi(change);
        return res;
    }
};

在这里插入图片描述

class Solution {
public:
      int smallestRangeII(vector<int>& nums, int k) {
        sort(nums.begin(), nums.end());
        int res = nums.back() - nums[0];
        int n = nums.size();
        for (int i = 0; i < n-1; ++i)
        {
            int l = min(nums[0]+k, nums[i+1]-k);
            int h = max(nums[n-1]-k, nums[i]+k);
            res = min(res, h-l);
        }

        return res;
    }
};