Codewars题记 ：Find the missing letter

1. Title:

#Find the missing letter

Write a method that takes an array of consecutive (increasing) letters as input and that returns the missing letter in the array.

You will always get an valid array. And it will be always exactly one letter be missing. The length of the array will always be at least 2.
The array will always contain letters in only one case.

Example:

['a','b','c','d','f'] -> 'e'
['O','Q','R','S'] -> 'P'
(Use the English alphabet with 26 letters!)

Have fun coding it and please don't forget to vote and rank this kata! :-)

I have also created other katas. Take a look if you enjoyed this kata!

2, my solution

 1 class Kata {
 2     public static char findMissingLetter(char[] array) {
 3         int nextASCLL = (int)array[0];
 4         
 5         int lostChar = 0;
 6         
 7         for (int i = 0; i < array.length; i++) {
 8             if ((int)array[i]!=nextASCLL) {
 9                 lostChar = nextASCLL;
10                 break;
11             }
12             ++ nextASCLL ;
13          }
 14          
15          return ( char ) lostChar;
16      }
 17 }

3, the best solution

 1 public class Kata
 2 {
 3   public static char findMissingLetter(char[] array){
 4     char expectableLetter = array[0];
 5     for(char letter : array){
 6       if(letter != expectableLetter) break;
 7       expectableLetter++;
 8     }
 9     return expectableLetter;
10   }
11 }

4, summary

　　The main topic is ascll char processed.

　　Every time we see the best solution to be able to learn the most simple wording.