Codeforces刷题之路——339A Helpful Maths

最新推荐文章于 2024-11-29 23:32:07 发布

原创最新推荐文章于 2024-11-29 23:32:07 发布 · 1k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#codeforces #算法 #java

Codeforces 专栏收录该内容

20 篇文章

订阅专栏

本文介绍了一种通过排序加法表达式中数字的方法，确保加数按非递减顺序排列，便于初学者进行计算。提供了Java实现代码。

Xenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation.

The teacher has written down the sum of multiple numbers. Pupils should calculate the sum. To make the calculation easier, the sum only contains numbers 1, 2 and 3. Still, that isn't enough for Xenia. She is only beginning to count, so she can calculate a sum only if the summands follow in non-decreasing order. For example, she can't calculate sum 1+3+2+1 but she can calculate sums 1+1+2 and 3+3.

You've got the sum that was written on the board. Rearrange the summans and print the sum in such a way that Xenia can calculate the sum.

Input

The first line contains a non-empty string s — the sum Xenia needs to count. String s contains no spaces. It only contains digits and characters "+". Besides, string s is a correct sum of numbers 1, 2 and 3. String s is at most 100 characters long.

Output

Print the new sum that Xenia can count.

Examples

input
3+2+1

output
1+2+3

input
1+1+3+1+3

output
1+1+1+3+3

input
2

output
2

题目大意：将输入的加法表达式转换成递增序列输出

解题思路：普通排序 + 字符串拼接

以下为解题代码（java实现）

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

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		String string = scanner.nextLine();
		String[] str = string.split("\\+");
		char[] ch = new char[str.length];
		for(int i = 0;i < ch.length;i++){
			ch[i] = str[i].charAt(0);
		}
		Arrays.sort(ch);
		StringBuffer result = new StringBuffer();
		result.append(ch[0]);
		for(int i = 1; i < ch.length;i++){
			result.append("+" +  String.valueOf(ch[i]));
		}
		System.out.println(result);
		scanner.close();
	}
}