CamelCase

Alice wrote 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 , print the number of words in  on a new line.
For example, . There are  words in the string.
Function Description
Complete the camelcase function in the editor below. It must return the integer number of words in the input string.
camelcase has the following parameter(s):
  • s: the string to analyze
Input Format
A single line containing string .
Constraints
Output Format
Print the number of words in string .
Sample Input
saveChangesInTheEditor
Sample Output
5
Explanation
String  contains five words:
  1. save
  2. Changes
  3. In
  4. The
  5. Editor
Thus, we print  on a new line.
Need help? Try this problem first to get familiar with HackerRank environment.

php

<?php

// Complete the camelcase function below.
function camelcase($s) {
preg_match_all('/((?:^|[A-Z])[a-z]+)/',$s,$matches);
return count($matches[0]);
}

$fptr = fopen(getenv("OUTPUT_PATH"), "w");

$stdin = fopen("php://stdin", "r");

$s = '';
fscanf($stdin, "%[^\n]", $s);

$result = camelcase($s);

fwrite($fptr, $result . "\n");

fclose($stdin);
fclose($fptr);

Comments

Popular posts from this blog

Compare the Triplets

Forming a Magic Square

Plus Minus