Skip to content

3330. Find the Original Typed String I 👍

  • Time: $O(n)$
  • Space: $O(1)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
class Solution {
 public:
  int possibleStringCount(string word) {
    int ans = 1;
    for (int i = 1; i < word.length(); ++i)
      if (word[i] == word[i - 1])
        ++ans;
    return ans;
  }
};

1
2
3
4
5
6
7
8
9
class Solution {
  public int possibleStringCount(String word) {
    int ans = 1;
    for (int i = 1; i < word.length(); ++i)
      if (word.charAt(i) == word.charAt(i - 1))
        ++ans;
    return ans;
  }
}

1
2
3
4
class Solution:
  def possibleStringCount(self, word: str) -> int:
    return 1 + sum(a == b
                   for a, b in itertools.pairwise(word))