Created
March 11, 2016 12:33
-
-
Save vltsu/9cf45c3e1078f8e0e086 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
A string S consisting of N characters is called properly nested if: | |
S is empty; | |
S has the form "(U)" where U is a properly nested string; | |
S has the form "VW" where V and W are properly nested strings. | |
For example, string "(()(())())" is properly nested but string "())" isn't. | |
Write a function: | |
class Solution { | |
public int solution(String S); | |
} | |
that, given a string S consisting of N characters, returns 1 if string S is properly nested and 0 otherwise. | |
For example, given S = "(()(())())", the function should return 1 and given S = "())", the function should return 0, as explained above. | |
Assume that: | |
N is an integer within the range [0..1,000,000]; | |
string S consists only of the characters "(" and/or ")". | |
Complexity: | |
expected worst-case time complexity is O(N); | |
expected worst-case space complexity is O(1) (not counting the storage required for input arguments). |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment