码迷,mamicode.com
首页 > 其他好文 > 详细

leetcode738

时间:2018-10-09 21:47:16      阅读:185      评论:0      收藏:0      [点我收藏+]

标签:==   ++   []   bsp   res   return   i++   public   temp   

public class Solution
    {
        public int MonotoneIncreasingDigits(int N)
        {
            var num = N.ToString();
            var len = num.Length;
            if (len == 1)
            {
                return N;
            }
            int[] X = new int[len];
            for (int i = 0; i < len; i++)
            {
                X[i] = Convert.ToInt32(num[i].ToString());
            }
            var change = true;
            while (change)
            {
                var change_count = 0;
                for (int i = 1; i < len; i++)
                {
                    var n1 = X[i - 1];
                    var n2 = X[i];
                    if (n1 > n2)
                    {
                        change_count++;
                        X[i - 1] -= 1;
                        for (int j = i; j < len; j++)
                        {
                            X[j] = 9;
                        }
                        change = true;
                        break;
                    }
                }
                if (change_count == 0)
                {
                    change = false;
                }
            }


            var temp = "";
            for (int i = 0; i < len; i++)
            {
                temp += X[i];
            }
            var result = Convert.ToInt32(temp);
            return result;
        }
    }

 

leetcode738

标签:==   ++   []   bsp   res   return   i++   public   temp   

原文地址:https://www.cnblogs.com/asenyang/p/9762717.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!