[LeetCode] Valid Parentheses

题目

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); // 栈内如果有数据,说明不符合
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值