fork download
copy 
  1. import java.util.*;
  2. import java.io.*;
  3. import java.lang.*;
  4.  
  5. class Main
  6. {
  7. 	public static void main (String[] args) throws java.lang.Exception
  8. 	{
  9. 		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
  10. 		int t = Integer.parseInt(reader.readLine());
  11. 		int[] input;
  12. 		for (int i = 1; i <= t; i++) {
  13. 			reader.readLine();
  14. 			input = Arrays.stream(reader.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
  15. 			System.out.println(nextHigherNumber(input));
  16. 		}
  17. 	}
  18.  
  19. 	private static long nextHigherNumber(int[] number) {
  20. 		// starting from right, find the case where left number is less than right
  21. 		int i;
  22. 		for (i = number.length - 1; i > 0; i--) {
  23. 			if (number[i - 1] < number[i]) {
  24. 				break;
  25. 			}
  26. 		}
  27.  
  28. 		if (i == 0)
  29. 			return -1;
  30.  
  31. 		i--;
  32. 		// find the next higher number than number[i]
  33. 		int nextMaxIdx = 0;
  34. 		int leastDiff = 9-0;
  35. 		int currentDiff;
  36. 		for (int j = i + 1; j < number.length; j++) {
  37. 			currentDiff = (number[j] - number[i]);
  38. 			if (number[j] > number[i] && currentDiff<leastDiff) {
  39. 				leastDiff = currentDiff;
  40. 				nextMaxIdx = j;
  41. 			}
  42. 		}
  43.  
  44. 		// swap
  45. 		int temp = number[i];
  46. 		number[i] = number[nextMaxIdx];
  47. 		number[nextMaxIdx] = temp;
  48.  
  49. 		// sort the rest of array
  50. 		Arrays.sort(number, i + 1, number.length);
  51.  
  52. 		return intArrayToNumber(number);
  53. 	}
  54.  
  55. 	private static long intArrayToNumber(int[] number) {
  56. 		long result = 0L;
  57. 		long placeMultiplier = 1L;
  58. 		for (int i = number.length - 1; i >= 0; i--) {
  59. 			result += number[i]*placeMultiplier;
  60. 			placeMultiplier*=10L;
  61. 		}
  62.  
  63. 		return result;
  64. 	}
  65. }
Success #stdin #stdout 0.14s 2184192KB
comments (?)
stdin
copy 
1
10
5 6 5 5 5 5 5 5 5 5
stdout
copy 
6555555555
https://ideone.com/NN8dHp
problem JNEXT, based on SPOJ submission 23459106 (JAVA), 2019-03-21 09:14:16
language:
Java (HotSpot 12)
created:
5 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!