[leetcode]Valid Parentheses
来源:互联网 发布:程序员的自我修养 epub 编辑:程序博客网 时间:2024/06/13 21:01
Valid Parentheses
Total Accepted: 48447 Total Submissions: 182941My SubmissionsGiven a string containing just the characters '('
, ')'
, '{'
, '}'
, '['
and ']'
, determine if the input string is valid.
The brackets must close in the correct order, "()"
and "()[]{}"
are all valid but "(]"
and "([)]"
are not.
很容易就想到使用堆栈来完成了。
不过本次堆栈有点复杂,使用了双向链表实现堆栈。
代码如下:
// test20ValidParentheses.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include "string"
using std::string;
bool isValid(string s);
bool pushPar(char s);
char popPar();
bool stackIsNull();
struct ListNode {
char val;
ListNode *next;
ListNode *pre;
ListNode(int x) : val(x), next(NULL) {}
};
ListNode *head=NULL;
ListNode *cur = head;
int _tmain(int argc, _TCHAR* argv[])
{
bool res = isValid("head");
return 0;
}
bool isValid(string s)
{
int n = s.size();
if (n < 1)
return true;
else
{
for (int i = 0; i < n; i++)
{
if (s[i] == '(' || s[i] == '[' || s[i] == '{')
{
pushPar(s[i]);
}
else if (s[i] == ')' || s[i] == ']' || s[i] == '}')
{
if (stackIsNull())
return false;
else
{
char ss = popPar();
if ((ss == '(' && s[i] != ')') || (ss == '[' && s[i] != ']') || (ss == '{' && s[i] != '}'))
return false;
}
}
}
if (stackIsNull())
return true;
else
return false;
}
}
bool pushPar(char s)
{
ListNode * temp;
temp = new ListNode(0);
temp->val = s;
temp->next = NULL;
if (head == NULL)
{
temp->pre = NULL;
head = temp;
cur = temp;
}
else
{
temp->pre = cur;
cur->next = temp;
cur = temp;
}
return true;
}
char popPar( )
{
char res = cur->val;
if (cur->pre == NULL)
{
cur = NULL;
head = NULL;
return res;
}
cur->pre->next = NULL;
cur = cur->pre;
return res;
}
bool stackIsNull()
{
if (head == NULL)
return true;
else
return false;
}
- LeetCode: Valid Parentheses
- LeetCode: Longest Valid Parentheses
- LeetCode: Valid Parentheses
- LeetCode Longest Valid Parentheses
- [Leetcode] Valid Parentheses
- LeetCode: Longest Valid Parentheses
- [Leetcode] Longest Valid Parentheses
- LeetCode : Valid Parentheses
- [leetcode]longest Valid Parentheses(!!)
- Leetcode: Valid Parentheses
- leetcode 52: valid parentheses
- [Leetcode] Longest Valid Parentheses
- leetcode Longest Valid Parentheses
- 【leetcode】Valid Parentheses
- 【leetcode】Longest Valid Parentheses
- [LeetCode]Longest Valid Parentheses
- [LeetCode]Valid Parentheses
- LeetCode-Valid Parentheses
- 看看山寨机子掉渣
- Class.forName的作用以及为什么要用它【转】
- Oracle Database(3)-归档日志相关参数配置
- LeetCode --- 110. Balanced Binary Tree
- 通过管道获取cmd输出
- [leetcode]Valid Parentheses
- 北大程序设计实习公开课编程作业,魔兽世界之二:装备
- OS 、TBB、CMake的解释
- dedecms更换目录
- Java并发编程:线程池的使用
- oj上做题的多次输入
- 去掉导航栏上的那条线如何实现
- GAEA Winsieve v1.2 1CD(快速输入和打印结晶粒度分析曲线)
- 数据结构:题目(5)找两个字符串的最长公共子串(非递归实现方法)