Leetcode 171 JAVA

public class Solution {private static Scanner sc = null;     private static final int RADIX = 26; Enum Alphabet {A (1), B (2), C (3), D (4), E (5), F (6), G (7), H (8), I (9), J (Ten), K (one), L (N), M (All), P (1         6), Q (+), R (+), S (+), T (+), U (+), V (+), W (All), X (s), Y (+), Z (26);         private int value;        Private Alphabet (int value) {this.value = value;        } public int GetValue () {return value;        } public void SetValue (int value) {this.value = value; } public int Getvaluebyname (String c) {for (Alphabet alp:Alphabet.values ()) {if (ALP                . Name (). Equals (c)) {return alp.value;        }} return 0;        }} public int titletonumber (String str) {int result = 0;        int alplength = Str.length ()-1; for (int i = 0; I <= alplength; i++) {result = result + Alphabet. ValueOf (String.valueof (Str.charat (alplength-i)). Value * (int) Math.pow (RADIX, i);    } return result; }}

Leetcode 171 JAVA