Skip to content

Create node_Wanghonglu.md #74

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.

Sign up for GitHub

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

Merged
bajdcc merged 1 commit into from
Jun 3, 2017
Merged

Create node_Wanghonglu.md #74

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
112 changes: 112 additions & 0 deletions leetcode/20/node_Wanghonglu.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,112 @@
class Solution {
public:
bool isValid(string s) {
char elem=0,left_elem=0,right_elem=0;
Stack *ptr = new Stack( (int)s.length() );
for( int i=0;i<s.size();i++ )
{
elem = s[i];
switch( elem )
{
case '[':
case '(':
case '{':
ptr->PushStack(elem);
break;
case ']':
case ')':
case '}':
{
ptr->GetTopStack(left_elem);
switch( left_elem )
{
case '[':
right_elem = ']';
break;
case '(':
right_elem = ')';
break;
case '{':
right_elem = '}';
break;
}
if( right_elem == elem )
{
ptr->PopStack();
break;
}
else
{
delete ptr;
return false;
}
}
default:
{
delete ptr;
return false;
}

}
}
if(ptr->IsEmptyStack())
{
delete ptr;
return true;
}
delete ptr;
return false;
}
class Stack{
public:
Stack( int size )
{
m_size = size;
m_ptr = new char[size];
memset( m_ptr, 0x00, size );
m_top = 0;
}
~Stack()
{
delete []m_ptr;
m_top = 0;
m_size = 0;
}
bool IsFullStack()
{
return m_size == m_top;
}
bool IsEmptyStack()
{
return m_top ==0;
}
bool PushStack( char elem )
{
if( IsFullStack() )
return false;
m_ptr[m_top] = elem;
m_top++;
return true;
}
bool PopStack( )
{
if( IsEmptyStack())
return false;
m_top--;
return true;
}
bool GetTopStack( char& elem )
{
if( IsEmptyStack() )
return false;
elem = m_ptr[m_top-1];
return true;
}
private:
char* m_ptr;
int m_top;
int m_size;
};


};