Programming Problem Two

Problem Statement:   Shashank likes strings in which consecutive characters are different. For example, he likes ABABA, while he dosen't like ABAA. Given a string congaing characters A and B only, he wants to change it to a string he likes. To do so he is allowed to delete the characters in the string. The problem is to fin d the minimum number of deletion required.

For example:

ABBAB -> ABAB (Requires 1 deletion)
AAAAAA -> NULL (Requires 6 deletion)
ABABA -> ABABA (Requires 0 deletion)

C++ Code:

1. #include <iostream>
2. #include <string>
3. #include <cstring>
4. using namespace std;
5. 
   
6. int delRequired(string testString)
7. {
8. size_t size = testString.length();
9. char arr[size+1];
10. strcpy(arr,testString.c_str());
11. int i, noOfDel = 0;
12. for(i = 0; i < size; ++i) {
13. if(arr[i] == arr[i+1]) {
14. noOfDel += 1;
15. }
16. }
17. return noOfDel;
18. }
19. 
    
20. int main()
21. {
22. int testCase, i = 0;
23. cin >> testCase;
24. int delArr[testCase];
25.  
26. while(testCase--) {
27. string testString;
28. cin >> testString;
29. delArr[i++] = delRequired(testString);
30. }
31. delArr[i] = -1;
32. i = 0;
33. while(delArr[i] != -1) {
34. cout << delArr[i] << endl;
35. i += 1;
36. }
37. return 0;
38. }