华为机试题：最大递减数

比眉伴天荒 2022-08-20 07:29 149阅读 0赞

<table style="margin:0px; padding:0px; width:970px; border:0px; border-collapse:collapse; border-spacing:0px; empty-cells:show; color:rgb(0,0,0); font-family:'Times New Roman',Arial,微软雅黑,宋体,Tahoma,Helvetica,SimSun,sans-serif,宋体"> 
 <tbody style="margin:0px; padding:0px"> 
  <tr style="margin:0px; padding:0px; height:26px"> 
   <td style="margin:0px; padding:6px 3px 3px; word-break:break-all; word-wrap:break-word; border-right-style:solid; border-right-width:1px; border-right-color:rgb(238,238,238); font-size:14px; border-bottom-style:solid; border-bottom-width:1px; border-bottom-color:rgb(238,238,238)"> 描述:&nbsp;</td> 
   <td style="margin:0px; padding:6px 3px 3px; word-break:break-all; word-wrap:break-word; font-size:14px; border-bottom-style:solid; border-bottom-width:1px; border-bottom-color:rgb(238,238,238)"> <p style="margin:0cm 0cm 0px 28px; padding-top:0px; padding-bottom:0px; text-indent:28px"> <span style="margin:0px; padding:0px; font-family:宋体">给出一个正整数，找到这个正整数中包含的最大递减数。一个数字的递减数是指相邻的数位从大到小排列的数字。如：</span>&nbsp;95345323<span style="margin:0px; padding:0px; font-family:宋体">，递减数有：</span>953,95,53,53,532,32,&nbsp;<span style="margin:0px; padding:0px; font-family:宋体">那么最大的递减数为</span>953<span style="margin:0px; padding:0px; font-family:宋体">。</span></p> <p style="margin-top:0px; margin-bottom:0px; padding-top:0px; padding-bottom:0px"> &nbsp;</p> <p style="margin-top:0px; margin-bottom:0px; padding-top:0px; padding-bottom:0px"> &nbsp;</p> </td> 
  </tr> 
 </tbody> 
</table>

#include "Degressive.h"
    #include <stdio.h>
    #include <stdlib.h>
    #include <string.h>
    
    /******************************************************************************
    
    Copyright (C), 2001-2011, Huawei Tech. Co., Ltd.
    
    ******************************************************************************
    File Name     :
    Version       :
    Author        :
    Created       : 
    Last Modified :
    Description   :
    Function List :
    
    History       :
    1.Date        : 
    Author      :
    Modification: Created file
    
    ******************************************************************************/
    
    
    
    //给出一个非负整数，找到这个非负整数中包含的最大递减数。一个数字的递减数是指相邻的数位从大到小排列的数字。
    //如： 95345323，递减数有：953,95,53,53,532,32, 那么最大的递减数为953。
    //如果输入的数字为负数，返回-1。
    int getMaxDegressiveNum (int num)
    {
        // your code here...
    	if (num < 0)
    	{
    		return -1;
    	}
    
    	char numchar[1000] = { 0 };
    	int i = 0, lens = 0;
    	int mindata = 0, maxmindata = 0;
    
    	sprintf_s(numchar, "%d", num);
    	lens = strlen(numchar);
    
    	/*初始化*/
    	mindata = numchar[0] - '0';
    	maxmindata = mindata;
    
    	for (i = 1; i < lens; i++)
    	{
    		if (numchar[i] < numchar[i - 1])
    		{
    			mindata = mindata * 10 + (numchar[i] - '0');
    		}
    		else
    		{
    			mindata = numchar[i] - '0';
    		}
    
    		if (maxmindata < mindata)
    		{
    			maxmindata = mindata;
    		}
    	}
    
    	return maxmindata;
    }