Loading... <div class="panel panel-default collapse-panel box-shadow-wrap-lg"><div class="panel-heading panel-collapse" data-toggle="collapse" data-target="#collapse-a29c0006ce4992a75278ad743f67459533" aria-expanded="true"><div class="accordion-toggle"><span>方法一:</span> <i class="pull-right fontello icon-fw fontello-angle-right"></i> </div> </div> <div class="panel-body collapse-panel-body"> <div id="collapse-a29c0006ce4992a75278ad743f67459533" class="collapse collapse-content"><p></p>用递增关系进行排序,if比较两个数大小如果判断为ture,则两数对换赋值,从而实现从小到大排列!<p></p></div></div></div> ```c #include <stdio.h> int main () { int a , b , c , d ,m ; scanf("%d,%d,%d,%d",&a ,&b ,&c ,&d); if(a>b){ m=a; a=b; b=m; } if(a>c){ m=a; a=c; c=m; } if(a>d){ m=a; a=d; d=m; } if(b>c){ m=b; b=c; c=m; } if(b>d){ m=b; b=d; d=m; } if(c>d){ m=c; c=d; d=m; } printf("%d<%d<%d<%d",a,b,c,d); } ``` <div class="panel panel-default collapse-panel box-shadow-wrap-lg"><div class="panel-heading panel-collapse" data-toggle="collapse" data-target="#collapse-9e1005da484d21415ba471cda4f2a36523" aria-expanded="true"><div class="accordion-toggle"><span>方法二</span> <i class="pull-right fontello icon-fw fontello-angle-right"></i> </div> </div> <div class="panel-body collapse-panel-body"> <div id="collapse-9e1005da484d21415ba471cda4f2a36523" class="collapse collapse-content"><p></p>用关系表达式进行判断,逐一排查<p></p></div></div></div> ```cpp #include<stdio.h> int main(){ int a , b , c , d ,m; scanf("%d,%d,%d,%d",&a , &b , &c ,&d); m=a>b?(a>c?(a>d?a:d):c):(b>c?(c>d?c:d):c); printf("%d",m); } ``` 方法三:待定 最后修改:2021 年 04 月 30 日 © 允许规范转载 打赏 赞赏作者 支付宝微信 赞 0 如果文章有用,请随意打赏。