寒假5

最新推荐文章于 2025-02-15 20:17:35 发布

憶yǐ

最新推荐文章于 2025-02-15 20:17:35 发布

阅读量131

点赞数

本文链接：https://blog.youkuaiyun.com/weixin_43024782/article/details/87068527

版权

本文介绍了如何在Java中进行字符插入、排序及求最低价格的算法实现。通过实例展示了字符数组的升序排序、逆序输出以及在适当位置插入新字符的方法。此外，还提供了一个求最低价格的示例，帮助理解数组遍历与比较的基本操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

插入字符

package hanjiazy5;

public class hanjia5_1 {
  public static void main(String[] args) {
	  char[] chars = new char[]{'a','b','c','e','f','p','u','z'};
		System.out.print("原字符序列：");
		for(int i = 0; i < chars.length; i++){
			System.out.print(chars[i] + " ");
		}
		int index = chars.length;
		char ch='m';
		System.out.println("\n待插入的字符是： "+ch);
      for(int i = 0; i < chars.length; i++){
          if(ch < chars[i]){
              index = i;
              break;
          }
      }			
      for(int j = chars.length-1; j > index; j--){
      	chars[j] = chars[j-1];
      }
      chars[index] = ch;
		System.out.println("插入字符的下标是："+index);
		System.out.print("插入后的字符序列是： ");
		for (int k = 0; k < chars.length; k++) {
			System.out.print(chars[k] + " ");
		}

}
}

升序、逆序

package hanjiazy5;

import java.util.Arrays;

public class hanjia5 {

	public static void main(String[] args) {
		char[] chars = new char[]{'a','c','u','b','e','p','f','z'};
		System.out.print("原字符序列：");
		for(int i = 0; i < chars.length; i++){
			System.out.print(chars[i] + " ");
		}
		Arrays.sort(chars);		
		System.out.print("\n升序排序后：");
		for(int i = 0; i < chars.length; i++){
			System.out.print(chars[i] + " ");
		}
		System.out.print("\n逆序输出为：");
		for(int i = chars.length-1; i >= 0; i--){
			System.out.print(chars[i] + " ");
		}

	}

}

求最低

package hanjiazy5;

import java.util.Scanner;

public class hanjia5_2 {

	public static void main(String[] args) {
		Scanner x =  new Scanner(System.in);
		int[] prices = new int[4];
		System.out.println("请输入4家店的价格");
		for(int i = 0; i < prices.length; i++){
			System.out.print("第" +(i+1)+ "家店的价格：");
			prices[i] = x.nextInt();
		}
		int min = prices[0];
		for(int i = 1; i < prices.length; i++){
			if(prices[i] < min){
				min = prices[i];
			}
		}
		System.out.println("最低价格是：" + min);
	}

}