【算法千题案例】每日LeetCode打卡——79.键盘行

输入：words = ["Hello","Alaska","Dad","Peace"]
输出：["Alaska","Dad"]

输入：words = ["omk"]
输出：[]

输入：words = ["adsdf","sfd"]
输出：["adsdf","sfd"]

public class Solution {
    public string[] FindWords(string[] words) {
        IList<string> list = new List<string>();
        string rowIdx = "12210111011122000010020202";
        foreach (string word in words) {
            bool isValid = true;
            char idx = rowIdx[char.ToLower(word[0]) - 'a'];
            for (int i = 1; i < word.Length; ++i) {
                if (rowIdx[char.ToLower(word[i]) - 'a'] != idx) {
                    isValid = false;
                    break;
                }
            }
            if (isValid) {
                list.Add(word);
            }
        }

        string[] ans = new string[list.Count];
        for (int i = 0; i < list.Count; ++i) {
            ans[i] = list[i];
        }
        return ans;
    }
}

通过
执行用时：152 ms，在所有 C# 提交中击败了49.50%的用户
内存消耗：41.4 MB，在所有 C# 提交中击败了24.90%的用户

class Solution {    
    public String[] findWords(String[] words) {
        List<String> list = new ArrayList<String>();
        String rowIdx = "12210111011122000010020202";
        for (String word : words) {
            boolean isValid = true;
            char idx = rowIdx.charAt(Character.toLowerCase(word.charAt(0)) - 'a');
            for (int i = 1; i < word.length(); ++i) {
                if (rowIdx.charAt(Character.toLowerCase(word.charAt(i)) - 'a') != idx) {
                    isValid = false;
                    break;
                }
            }
            if (isValid) {
                list.add(word);
            }
        }
        String[] ans = new String[list.size()];
        for (int i = 0; i < list.size(); ++i) {
            ans[i] = list.get(i);
        }
        return ans;
    }
}

通过
执行用时：0 ms，在所有 Java  提交中击败了100.76%的用户
内存消耗：36.4 MB，在所有 Java 提交中击败了89.40%的用户