Output match the task condition
package com.codegym.task.task30.task3010;
import java.util.HashMap;
import java.util.Map;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
/*
Smallest possible radix
*/
public class Solution {
public static void main(String[] args) {
try{
String s1 = args[0];
Pattern pattern = Pattern.compile("[^A-Za-z0-9]");
Matcher matcher = pattern.matcher(s1);
if(!matcher.find()){
s1 = s1.toLowerCase();
String chars = "abcdefghijklmnopqrstuvwxyz";
Map<Character,Integer> map = new HashMap<>();
for(int i = 0 ; i<26 ; i++)
map.put(chars.charAt(i),i+11);
try{
int i = Integer.parseInt(s1);
System.out.println("2");
}catch (NumberFormatException e){
char maxChar = Solution.getHighetchar(s1);
System.out.println(map.get(maxChar));
}
}
else
System.out.println("Invalid");
}catch (Exception e){
//e.printStackTrace();
}
}
private static char getHighetchar(String s){
char max = 'a';
for(int i = 0 ; i<s.length() ; i++){
if(max < s.charAt(i))
max = s.charAt(i);
}
return max;
}
}