LeetCode 500 Keyboard Row

最新推荐文章于 2021-11-01 22:24:35 发布

HelloSilicat

最新推荐文章于 2021-11-01 22:24:35 发布

阅读量351

点赞数

分类专栏： Leetcode 文章标签： leetcode c

本文链接：https://blog.csdn.net/peisir/article/details/74643562

版权

Leetcode 专栏收录该内容

65 篇文章 0 订阅

订阅专栏

500 Keyboard Row

Description

Given a List of words, return the words that can be typed using letters of alphabet on only one row’s of American keyboard like the image below.

Input: ["Hello", "Alaska", "Dad", "Peace"]
Output: ["Alaska", "Dad"]

Note:
1.You may use one character in the keyboard more than once.
2.You may assume the input string will only contain letters of alphabet.

Solution

//题目的意思就是判断一个字符串的所有字符是否处于键盘布局的同一行
//我的想法是以字符串第一个字符处于的行 为基准，如果后面的字符和它不是同一行的，那么判定为失败
char** findWords(char** words, int wordsSize, int *returnSize)
{
    int a[26]={1,0,0,1,2,1,1,1,2,1,1,1,0,0,2,2,2,2,1,2,2,0,2,0,2};
    char **rnt = (char **)malloc(sizeof(char *) * wordsSize);
    for (int i = 0;i < wordsSize;i++) {
        rnt[i] = (char *)malloc(sizeof(char) * 30);
    }
    int r = 0;
    for (int i = 0;i < wordsSize;i++) {
        int flag = 1;
        int p = a[tolower(words[i][0]) - 'a'];
        for (int j = 1;j < strlen(words[i]);j++) {
            if (p != a[tolower(words[i][j]) - 'a'])
                flag = 0;
        }
        if (flag) {
            strcpy(rnt[r++],words[i]);
        }
    }
    *returnSize = r;
    return rnt;
}