algorithms/leetcode/C#/No1023.camelcase-matching.cs at master · ecmadao/algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/*
 * Difficulty:
 * Medium
 *
 * Desc:
 * A query word matches a given pattern if we can insert lowercase letters to the pattern word so that it equals the query.
 * (We may insert each character at any position, and may insert 0 characters.)
 * Given a list of queries, and a pattern, return an answer list of booleans, where answer[i] is true if and only if queries[i] matches the pattern.
 *
 * Example 1:
 * Input: queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FB"
 * Output: [true,false,true,true,false]
 * Explanation:
 * "FooBar" can be generated like this "F" + "oo" + "B" + "ar".
 * "FootBall" can be generated like this "F" + "oot" + "B" + "all".
 * "FrameBuffer" can be generated like this "F" + "rame" + "B" + "uffer".
 *
 * Example 2:
 * Input: queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBa"
 * Output: [true,false,true,false,false]
 * Explanation:
 * "FooBar" can be generated like this "Fo" + "o" + "Ba" + "r".
 * "FootBall" can be generated like this "Fo" + "ot" + "Ba" + "ll".
 *
 * Example 3:
 * Input: queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBaT"
 * Output: [false,true,false,false,false]
 * Explanation:
 * "FooBarTest" can be generated like this "Fo" + "o" + "Ba" + "r" + "T" + "est".
 *
 * Note:
 * 1 <= queries.length <= 100
 * 1 <= queries[i].length <= 100
 * 1 <= pattern.length <= 100
 * All strings consists only of lower and upper case English letters.
*/

public class Solution {
    public IList<bool> CamelMatch(string[] queries, string pattern) {
        List<bool> res = new List<bool>();

        foreach (string query in queries) {
            int i = 0;
            int j = 0;
            bool tmp = true;

            while (i < query.Length && j < pattern.Length) {
                if (query[i] == pattern[j]) {
                    i += 1;
                    j += 1;
                    continue;
                }
                if (query[i] < 97) {
                    tmp = false;
                    break;
                } else {
                    i += 1;
                }
            }

            if (tmp && j < pattern.Length) tmp = false;

            if (tmp && i < query.Length) {
                while (i < query.Length) {
                    if (query[i] < 97) {
                        tmp = false;
                        break;
                    }
                    i += 1;
                }
            }

            res.Add(tmp);
        }

        return res;
    }
}