leetcode20200608 有效的括号 合并两个有序链表

1.有效的括号
遇到左括号压入栈中 遇到右括号与之匹配则出栈

class Solution {
public:
    bool isValid(string s) {
        stack<char>symbol;
        if(s.size()==0){return true;}
        for(int i=0;i<s.size();i++){
            if(s[i]=='(' || s[i]=='[' ||s[i]=='{'){
                symbol.push(s[i]);
            }
            else{
                if(symbol.empty()){return false;}
            
             if (s[i]==')'&&symbol.top()=='(')
            {symbol.pop();}
            else if(s[i]==']'&& symbol.top()=='[')
            {symbol.pop();}
            else if(s[i]=='}' && symbol.top()=='{')
            {symbol.pop();}
            else{ return false;}}
        }
        if(symbol.size()==0){return true;}
        else{return false;}
    }
};

2.合并两个有序链表
其理则一也 两个有序数组也是这样的

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        if(NULL == l1) return l2;
        if(NULL == l2) return l1;
        
        ListNode* p1 = l1;
        ListNode* p2 = l2;
        
        ListNode* head = new ListNode(-1);
        ListNode* curNode = head;
        
        while(NULL != p1 && NULL != p2)
        {
            if(p1->val < p2->val)
            {
                curNode->next = p1;
                curNode = p1;
                p1 = p1->next;
            }
            else
            {
                curNode->next = p2;
                curNode = p2;
                p2 = p2->next;
            }
        }
        
        if(NULL != p1)
            curNode->next = p1;
        if(NULL != p2)
            curNode->next = p2;
        
        return head->next;
    }
};