[LeetCode] Valid Parentheses
来源:互联网 发布:java线程池需要关闭吗 编辑:程序博客网 时间:2024/06/08 06:27
题目
https://leetcode.com/problems/valid-parentheses/
Given 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.
代码
73 / 73 test cases passed.Runtime: 3 ms
bool isValid(char* s) { if (s == NULL) return false; if (s[0] == '\0') return true; int len = strlen(s); char *stack = (char*)malloc(len); stack[0] = s[0]; int top = 0; int i = 1; while (s[i] != '\0') { if (s[i] == ')' && top >= 0 && stack[top] == '(' || s[i] == ']' && top >= 0 && stack[top] == '[' || s[i] == '}' && top >= 0 && stack[top] == '{') { top--; i++; } else if (s[i] == '(' || s[i] == '[' || s[i] == '{') { top++; stack[top] = s[i]; i++; } else { return false; } } free(stack); return (top<0); // 栈内如果有数据,说明不符合}
阅读全文
0 0
- 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
- have a test..
- Git 学习笔记1
- koa 实现 jwt 认证
- 《弃子长安》第八章 昨日黄花
- sprintf详解
- [LeetCode] Valid Parentheses
- Windows下PHP 5.6+Apache 2.4+MySQL 5.5安装与配置
- SEED-DIM3517实验五记录
- 如何搜索相似的图片,如何通过识别图像搜索图片
- java.InternalError:name is too long to represent
- 1.python类型注意点
- 算法入门经典第二版 3-4 Periodic Strings
- 【转载】使用图灵机器人接口开发微信公众号聊天功能、设置自定义菜单及申请测试账号
- 每天一个linux命令(29):chgrp命令