camelcase-hankerrank

int camelcase(string s) {

int cnt=0;

int a;

for(int i=0;i<s.size();i++)

{

a=s[i];

if(65<=a&&a<=90)

{

cnt++;

 

}

}

cnt++;

return cnt;

}