738. Monotone Increasing Digits（贪心）

最新推荐文章于 2020-12-15 10:17:28 发布

stsfang

最新推荐文章于 2020-12-15 10:17:28 发布

阅读量245

点赞数

分类专栏： LeetCode 文章标签： greedy

本文链接：https://blog.csdn.net/w_bu_neng_ku/article/details/79004796

版权

LeetCode 专栏收录该内容

69 篇文章 0 订阅

订阅专栏

1.题目描述

Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits.

(Recall that an integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x <= y.)

Example 1:
Input: N = 10
Output: 9
Example 2:
Input: N = 1234
Output: 1234
Example 3:
Input: N = 332
Output: 299

Note: N is an integer in the range [0, 10^9].

2.代码

思路：遇到第一个元素 $copy[i]<copy[i-1]$ 时，从 $copy[i-1]$ 开始重写（减少最小），如 $12387990$ 重写为 $12379999$ 。rewriteCopy方法是从首位开始重写，实际与recover方法重写是一样的，有点冗余了。
方法：简单的自顶向下分解。

class Solution {
public:
    int monotoneIncreasingDigits(int N) {
        int t = N;
        vector<int> digits;
        for(int t = N, r = t%10; t != 0; r = t%10) {
            digits.push_back(r);
            t /= 10;
        }

        vector<int> copy(digits.begin(),digits.end());
        reverse(copy.begin(),copy.end());
        for(int i = 1; i < copy.size(); ++i) {
            if(copy[i] < copy[i-1]) {
                checkPre(copy, i);      
            }

        }
        int res = 0;
        for(int i = 0; i < copy.size(); ++i) {
            res = (res*10 + copy[i]);
        }
        return res;
    }
    void checkPre(vector<int>& copy, int index) {
        if(index-1 == 0) {
            rewriteCopy(copy);
            return;
        } else {
            recover(copy, index-1);                 
        }
    }
    void rewriteCopy(vector<int>& copy) {
        vector<int> res;
        if(copy[0] == 1) {
            res.push_back(9);
            for(int i = 0; i < copy.size()-2;++i) {
                res.push_back(9);
            } 
        } else {
            res.push_back(copy[0]-1);
            for(int i = 0; i < copy.size()-1;++i) {
                res.push_back(9);
            }           
        }
        copy = res;
    }
    void recover(vector<int>&copy, int index) {
        copy[index] -= 1;
        for(int i = index+1; i < copy.size(); ++i) {
            copy[i] = 9;
        }
        //递归从index-1开始重写 
        if(index-1>=0)  {
            if(copy[index] < copy[index-1]) {
                recover(copy, index-1);     
            }           
        }
        return;
    }
    void print(vector<int>& out) {
        for(int i = 0; i < out.size(); ++i)
            cout<< out[i] << " ";
        cout << endl;
    }
};