Cerinta completa

There is a sequence of words in CamelCase as a string of letters, , having the following properties:

  • It is a concatenation of one or more words consisting of English letters.
  • All letters in the first word are lowercase.
  • For each of the subsequent words, the first letter is uppercase and rest of the letters are lowercase.

Given , determine the number of words in .

Example

There are words in the string: ‘one’, ‘Two’, ‘Three’.

Function Description

Complete the camelcase function in the editor below.

camelcase has the following parameter(s):

  • string s: the string to analyze

Returns

  • int: the number of words in

Input Format

A single line containing string .

Constraints

Sample Input

saveChangesInTheEditor

Sample Output

5

Explanation

String contains five words:

  1. save
  2. Changes
  3. In
  4. The
  5. Editor

Need help? Try this problem first to get familiar with HackerRank environment.

Limbajul de programare folosit: python3

Cod:

#!/bin/python3

def camelcase(s):
    if not s:
        return 0
    return 1 + sum(1 for ch in s if 'A' <= ch <= 'Z')

if __name__ == '__main__':
    s = input().strip()
    print(camelcase(s))

Scor obtinut: 1.0

Submission ID: 464589634

Link challenge: https://www.hackerrank.com/challenges/camelcase/problem

CamelCase