输入数组，最大的与第一个元素交换，最小的与最后一个代码,Java代码库,德仔网

代码语言
代码分类
【Java】输入数组，最大的与第一个元素交换，最小的与最后一个
作者:Dezai.CN / 发布于2011/3/25/ 1412
<div><span style="color: #0000ff">import</span><span style="color: #000000"> java.util.</span><span style="color: #000000">*</span><span style="color: #000000">; 
</span><span style="color: #0000ff">public</span><span style="color: #000000"> </span><span style="color: #0000ff">class</span><span style="color: #000000"> Ex35 {
</span><span style="color: #0000ff">public</span><span style="color: #000000"> </span><span style="color: #0000ff">static</span><span style="color: #000000"> </span><span style="color: #0000ff">void</span><span style="color: #000000"> main(String[] args) { 
</span><span style="color: #0000ff">int</span><span style="color: #000000"> i, min, max, n, temp1, temp2; 
</span><span style="color: #0000ff">int</span><span style="color: #000000"> a[]; 
System.out.println(</span><span style="color: #000000">"</span><span style="color: #000000">输入数组的长度:</span><span style="color: #000000">"</span><span style="color: #000000">); 
Scanner keyboard </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #0000ff">new</span><span style="color: #000000"> Scanner(System.in); 
n </span><span style="color: #000000">=</span><span style="color: #000000"> keyboard.nextInt(); 
a </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #0000ff">new</span><span style="color: #000000"> </span><span style="color: #0000ff">int</span><span style="color: #000000">[n]; 
</span><span style="color: #0000ff">for</span><span style="color: #000000"> (i </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000">; i </span><span style="color: #000000"><</span><span style="color: #000000"> n; i</span><span style="color: #000000">++</span><span style="color: #000000">) { 
System.out.print(</span><span style="color: #000000">"</span><span style="color: #000000">输入第</span><span style="color: #000000">"</span><span style="color: #000000"> </span><span style="color: #000000">+</span><span style="color: #000000"> (i </span><span style="color: #000000">+</span><span style="color: #000000"> </span><span style="color: #000000">1</span><span style="color: #000000">) </span><span style="color: #000000">+</span><span style="color: #000000"> </span><span style="color: #000000">"</span><span style="color: #000000">个数据</span><span style="color: #000000">"</span><span style="color: #000000">); 
a[i] </span><span style="color: #000000">=</span><span style="color: #000000"> keyboard.nextInt(); 
} 
</span><span style="color: #008000">//</span><span style="color: #008000">以上是输入整个数组</span><span style="color: #008000">
</span><span style="color: #000000">max </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000">; 
min </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000">; 
</span><span style="color: #008000">//</span><span style="color: #008000">设置两个标志,开始都指向第一个数</span><span style="color: #008000">
</span><span style="color: #0000ff">for</span><span style="color: #000000"> (i </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #000000">1</span><span style="color: #000000">; i </span><span style="color: #000000"><</span><span style="color: #000000"> n; i</span><span style="color: #000000">++</span><span style="color: #000000">) { 
</span><span style="color: #0000ff">if</span><span style="color: #000000"> (a[i] </span><span style="color: #000000">></span><span style="color: #000000"> a[max]) 
max </span><span style="color: #000000">=</span><span style="color: #000000"> i; </span><span style="color: #008000">//</span><span style="color: #008000">遍历数组,如果大于a[max]，就把他的数组下标赋给max</span><span style="color: #008000">
</span><span style="color: #0000ff">if</span><span style="color: #000000"> (a[i] </span><span style="color: #000000"><</span><span style="color: #000000"> a[min]) 
min </span><span style="color: #000000">=</span><span style="color: #000000"> i; </span><span style="color: #008000">//</span><span style="color: #008000">同上，如果小于a[min],就把他的数组下标赋给min</span><span style="color: #008000">
</span><span style="color: #000000">} 
</span><span style="color: #008000">//</span><span style="color: #008000">以上for循环找到最大值和最小值，max是最大值的下标，min是最小值的下标</span><span style="color: #008000">
</span><span style="color: #000000">temp1 </span><span style="color: #000000">=</span><span style="color: #000000"> a[</span><span style="color: #000000">0</span><span style="color: #000000">]; 
temp2 </span><span style="color: #000000">=</span><span style="color: #000000"> a[min]; </span><span style="color: #008000">//</span><span style="color: #008000">这两个temp只是为了在交换时使用</span><span style="color: #008000">
</span><span style="color: #000000">
a[</span><span style="color: #000000">0</span><span style="color: #000000">] </span><span style="color: #000000">=</span><span style="color: #000000"> a[max]; 
a[max] </span><span style="color: #000000">=</span><span style="color: #000000"> temp1; </span><span style="color: #008000">//</span><span style="color: #008000">首先交换a[0]和最大值a[max]</span><span style="color: #008000">
</span><span style="color: #000000">
</span><span style="color: #0000ff">if</span><span style="color: #000000"> (min </span><span style="color: #000000">!=</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000">) { </span><span style="color: #008000">//</span><span style="color: #008000">如果最小值不是a[0]，执行下面</span><span style="color: #008000">
</span><span style="color: #000000">a[min] </span><span style="color: #000000">=</span><span style="color: #000000"> a[n </span><span style="color: #000000">-</span><span style="color: #000000"> </span><span style="color: #000000">1</span><span style="color: #000000">]; 
a[n </span><span style="color: #000000">-</span><span style="color: #000000"> </span><span style="color: #000000">1</span><span style="color: #000000">] </span><span style="color: #000000">=</span><span style="color: #000000"> temp2; </span><span style="color: #008000">//</span><span style="color: #008000">交换a[min]和a[n-1]</span><span style="color: #008000">
</span><span style="color: #000000">} </span><span style="color: #0000ff">else</span><span style="color: #000000"> { </span><span style="color: #008000">//</span><span style="color: #008000">如果最小值是a[0],执行下面</span><span style="color: #008000">
</span><span style="color: #000000">a[max] </span><span style="color: #000000">=</span><span style="color: #000000"> a[n </span><span style="color: #000000">-</span><span style="color: #000000"> </span><span style="color: #000000">1</span><span style="color: #000000">]; 
a[n </span><span style="color: #000000">-</span><span style="color: #000000"> </span><span style="color: #000000">1</span><span style="color: #000000">] </span><span style="color: #000000">=</span><span style="color: #000000"> temp1; 
} 

</span><span style="color: #0000ff">for</span><span style="color: #000000"> (i </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000">; i </span><span style="color: #000000"><</span><span style="color: #000000"> n; i</span><span style="color: #000000">++</span><span style="color: #000000">) { </span><span style="color: #008000">//</span><span style="color: #008000">输出数组</span><span style="color: #008000">
</span><span style="color: #000000">System.out.print(a[i] </span><span style="color: #000000">+</span><span style="color: #000000"> </span><span style="color: #000000">"</span><span style="color: #000000"> </span><span style="color: #000000">"</span><span style="color: #000000">); 
} 
}
}
</span></div>
试试其它关键字
同语言下
可能有用的
Dezai.CN贡献的其它代码(4037)