算法编程题笔记

最新推荐文章于 2025-02-05 22:00:22 发布

pang9998

最新推荐文章于 2025-02-05 22:00:22 发布

阅读量222

点赞数 1

分类专栏： Algorithm（算法）

本文链接：https://blog.youkuaiyun.com/pang9998/article/details/99898138

版权

Algorithm（算法）专栏收录该内容

2 篇文章

订阅专栏

博客主要探讨了如何将输入的正整数数组连接成一个数，并找出所有可能排列中最小的一个。通过具体例子32,231，博主展示了如何得到最小排列23132。" 84938006,8259497,C++控制结构详解：if、switch与循环,"['C++编程', '控制流', '程序设计']

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

算法编程题：

输入一个正整数数组，将它们连接起来排成一个数，输出能排出的所有数字中最小的一个

输入:

32,231

输出：

23132

import java.util.Arrays;
import java.util.Scanner;

public class Main7
{
	public static void main(String[] args)
	{
		Scanner cin = new Scanner(System.in);
		// 读取输入，直到没有整型数据可读
		// while(cin.hasNextInt())
		// while (cin.hasNextLine())
		while (cin.hasNextLine())
		{
			String s = cin.nextLine();
			String[] str = sort(s);
			if (str.length > 0)
			{
				System.out.println(Arrays.toString(str));
			}
		}
	}

	public static String[] sort(String s)
	{
		String[] arr = s.split(",");
		while (true)
		{
			boolean ok = true;
			for (int j = 0; j < arr.length - 1; j++)
			{

				if (!checkSwap(arr[j], arr[j + 1]))
				{
					String tmp = "";
					tmp = arr[j];
					arr[j] = arr[j + 1];
					arr[j + 1] = tmp;
					ok = false;
					System.out.println(Arrays.toString(arr));
				}
			}
			if (ok) break;
		}
		return arr;
	}

	/**
	 * 
	 * @Description: 检查是否需要交换两个数
	 * @param str1
	 * @param str2
	 * @return boolean
	 * @throws
	 */
	public static boolean checkSwap(String str1, String str2)
	{
		long int1 = Long.parseLong(str1 + str2);
		long int2 = Long.parseLong(str2 + str1);
		if (int2 > int1)
		{
			return true;
		}
		else
		{
			return false;
		}
	}

}

输出结果如下：

输入： 9191,1912,8,7,32,182,13,56,6,5,211,812
第一趟 [1912, 9191, 8, 7, 32, 182, 13, 56, 6, 5, 211, 812]
第二趟 [1912, 8, 9191, 7, 32, 182, 13, 56, 6, 5, 211, 812]
    		[1912, 8, 7, 9191, 32, 182, 13, 56, 6, 5, 211, 812]
	        [1912, 8, 7, 32, 9191, 182, 13, 56, 6, 5, 211, 812]
	        [1912, 8, 7, 32, 182, 9191, 13, 56, 6, 5, 211, 812]
		[1912, 8, 7, 32, 182, 13, 9191, 56, 6, 5, 211, 812]
		[1912, 8, 7, 32, 182, 13, 56, 9191, 6, 5, 211, 812]
		[1912, 8, 7, 32, 182, 13, 56, 6, 9191, 5, 211, 812]
		[1912, 8, 7, 32, 182, 13, 56, 6, 5, 9191, 211, 812]
		[1912, 8, 7, 32, 182, 13, 56, 6, 5, 211, 9191, 812]
		[1912, 8, 7, 32, 182, 13, 56, 6, 5, 211, 812, 9191]
		[1912, 7, 8, 32, 182, 13, 56, 6, 5, 211, 812, 9191]
		[1912, 7, 32, 8, 182, 13, 56, 6, 5, 211, 812, 9191]
		[1912, 7, 32, 182, 8, 13, 56, 6, 5, 211, 812, 9191]
		[1912, 7, 32, 182, 13, 8, 56, 6, 5, 211, 812, 9191]
		[1912, 7, 32, 182, 13, 56, 8, 6, 5, 211, 812, 9191]
		[1912, 7, 32, 182, 13, 56, 6, 8, 5, 211, 812, 9191]
		[1912, 7, 32, 182, 13, 56, 6, 5, 8, 211, 812, 9191]
		[1912, 7, 32, 182, 13, 56, 6, 5, 211, 8, 812, 9191]
		[1912, 7, 32, 182, 13, 56, 6, 5, 211, 812, 8, 9191]
		[1912, 32, 7, 182, 13, 56, 6, 5, 211, 812, 8, 9191]
		[1912, 32, 182, 7, 13, 56, 6, 5, 211, 812, 8, 9191]
		[1912, 32, 182, 13, 7, 56, 6, 5, 211, 812, 8, 9191]
		[1912, 32, 182, 13, 56, 7, 6, 5, 211, 812, 8, 9191]
		[1912, 32, 182, 13, 56, 6, 7, 5, 211, 812, 8, 9191]
		[1912, 32, 182, 13, 56, 6, 5, 7, 211, 812, 8, 9191]
		[1912, 32, 182, 13, 56, 6, 5, 211, 7, 812, 8, 9191]
		[1912, 182, 32, 13, 56, 6, 5, 211, 7, 812, 8, 9191]
		[1912, 182, 13, 32, 56, 6, 5, 211, 7, 812, 8, 9191]
		[1912, 182, 13, 32, 56, 5, 6, 211, 7, 812, 8, 9191]
		[1912, 182, 13, 32, 56, 5, 211, 6, 7, 812, 8, 9191]
		[182, 1912, 13, 32, 56, 5, 211, 6, 7, 812, 8, 9191]
		[182, 13, 1912, 32, 56, 5, 211, 6, 7, 812, 8, 9191]
		[182, 13, 1912, 32, 5, 56, 211, 6, 7, 812, 8, 9191]
		[182, 13, 1912, 32, 5, 211, 56, 6, 7, 812, 8, 9191]
		[13, 182, 1912, 32, 5, 211, 56, 6, 7, 812, 8, 9191]
		[13, 182, 1912, 32, 211, 5, 56, 6, 7, 812, 8, 9191]
		[13, 182, 1912, 211, 32, 5, 56, 6, 7, 812, 8, 9191]
		[13, 182, 1912, 211, 32, 5, 56, 6, 7, 812, 8, 9191]