LeetCode第四天(最长连续序列)前置数字判断跳过,(有效的括号)栈元素对称

class Solution {
    public int longestConsecutive(int[] nums) {
// 泛型
  Set<Integer> num_set = new HashSet<Integer>();
// 去重
for(int num : nums){
    num_set.add(num);
}
int maxLen = 0;
for(int num : num_set){
    // 检查前置数字是否存在
    if(!num_set.contains(num - 1)){
        // 最小权限访问
            int currentNum = num;
            int currentLen = 1;
            //如果数字后置存在则增加
        while(num_set.contains(currentNum + 1)){
                currentNum +=1;
                currentLen +=1;
        }

        // 挑出最大的间隔长度
        maxLen = Math.max(maxLen , currentLen);
    }
}
        return maxLen;


    }
}

function longestConsecutive(nums: number[]): number {
    let mySet: Set<number> = new Set<number>();
    for(let num of nums){
            mySet.add(num);
    }
    let maxLen:number = 0;
    for(let num of mySet){
        if(!mySet.has(num - 1)){
            let currenNum:number = num;
            let currenLen:number = 1;
        while(mySet.has(currenNum + 1) ){
            currenNum += 1;
            currenLen +=1;
        }
        maxLen = Math.max(maxLen, currenLen);

        }
    }


        return maxLen;

};

class Solution {
    public boolean isValid(String s) {
// 括号不成对
 if (s.length() % 2 == 1) return false;
// 哈希表的键为右括号，值为相同类型的左括号
 Map<Character, Character> pairs = new HashMap<Character, Character>() {{
            put(')', '(');
            put(']', '[');
            put('}', '{');
        }};
        // 创建栈
 Deque<Character> stack = new LinkedList<Character>();
//  循环判断是否成对
for(int i = 0; i<s.length() ; i++ ){
    // 字符串解构
    char ch = s.charAt(i);
    // 如果字符串是左括号
    if(pairs.containsKey(ch)){
        // 如果栈为空或者栈顶不是对应右括号
            if(stack.isEmpty() || stack.peek()!=pairs.get(ch)) {
                return false;
            }
            // 移除栈顶
            stack.pop();    
    } else{
        // 压入栈顶
        stack.push(ch);
    }
}
        return stack.isEmpty();

    }
}