CamelCase in java

There is a sequence of words in camelCase as a string of letters, s , 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 s , determine the number of words in s.

Example
s = oneTwoThree There are 3 words in the string: “one”, “Two”, “Three”.

Input Format A single line containing string .

Output Format A single integer which is the total number of words in the string

Constraints

• 1 <= length of s <= 10⁵

Sample Input

saveChangesInTheEditor

Sample Output

5

Explanation

String contains five words:

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

Solution of CamelCase in java:–

import java.util.*;
import java.lang.*;
import java.io.*;

public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		//your code here
      Scanner sc = new Scanner(System.in);
      String str = sc.next();
      int count=1;
      for(int i=0;i<str.length();i++)
        {
          char ch=str.charAt(i);
          if(ch>='A' && ch<='Z')
          {
            count++;
          }
        }
      System.out.print(count);
	}
}