giri.riggy
BAN USERpublic static void main(String[] aStrings){
Scanner scanner = new Scanner(System.in);
System.out.println("Enter the String");
String input = scanner.next();
input = input.substring(0).toLowerCase();
char[] s = input.toCharArray();
Arrays.sort(s);
String sortedInputString = new String(s);
int len = sortedInputString.length()-1;
char fAlpha = sortedInputString.charAt(0);
int f = (int)fAlpha;
int found = 0,hcount = 1;
for (int lcount=0 ; lcount < len && found == 0 ; lcount++,hcount++) {
if(((int)sortedInputString.charAt(hcount) - (int)sortedInputString.charAt(lcount)) > 1)
found = 1;
if(((int)sortedInputString.charAt(hcount) - (int)sortedInputString.charAt(lcount) != 0))
f++;
}
if(found == 0)
System.out.println("NONE");
else{
char missingAlpha = (char)f;
String missing = ""+ missingAlpha;
System.out.println(missing + " is the missing character .");
}
}
Is there any check for upper case and lower case letter in this algorithm ?
- giri.riggy February 25, 2014