Name:Unknown
Clan:Unknown
Member Since:May 2022
Last Seen:Jun 2022
Profiles:
Following:0
Followers:0
Allies:0
This kumite determines if a string only has closed parentheses. The goal is to optimize the runtime of the program. Currently, it runs in about 2.8 seconds through the test suite. Can it be better?
bool isBalanced(const std::string& s) {
int count = 0;
for (size_t i = 0; i < s.length(); i++) {
if (s[i] == '(') {
count++;
}
if (s[i] == ')') {
if (count <= 0) { return false; }
count--;
}
}
return true;
}Describe(tests)
{
It(test1)
{
Assert::That(isBalanced(""), Equals(true));
}
It(test2)
{
Assert::That(isBalanced("()"), Equals(true));
}
It(test3)
{
Assert::That(isBalanced("()()"), Equals(true));
}
It(test4)
{
Assert::That(isBalanced("(())"), Equals(true));
}
It(test5)
{
Assert::That(isBalanced(")()"), Equals(false));
}
It(test6)
{
Assert::That(isBalanced("(()()()))"), Equals(false));
}
It(test7)
{
Assert::That(isBalanced("((12+32)*33)"), Equals(true));
}
};