Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create Valid Parentheses #8

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 30 additions & 0 deletions Public/Valid Parentheses
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
// link- https://leetcode.com/problems/valid-parentheses/
// Question:
// Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

// An input string is valid if:

// 1. Open brackets must be closed by the same type of brackets.
// 2. Open brackets must be closed in the correct order.



class Solution {
public boolean isValid(String s) {
LinkedList<Character> stack = new LinkedList<>();
for(int i = 0; i < s.length(); i++) {
char ch = s.charAt(i);
if(ch == '(' || ch == '[' || ch == '{') {
stack.addFirst(ch);
} else {
if(ch == ')' && stack.size() > 0 && stack.getFirst() == '(') stack.removeFirst();
else if(ch == ']' && stack.size() > 0 && stack.getFirst() == '[') stack.removeFirst();
else if(ch == '}' && stack.size() > 0 && stack.getFirst() == '{') stack.removeFirst();
else return false;
}
}

if(stack.size() > 0) return false;
return true;
}
}