6095. 强密码检验器 II

循环遍历每个字符判断，对于特殊字符，直接使用一个字符串去存储，利用find方法判断是否存在

class Solution {
public:
    bool strongPasswordCheckerII(string password) {
        if(password.size() < 8){
          return false;
        }
      
        // 方便后面判断特殊字符是否存在
        string specialStr = "[email protected]#$%^&*()-+";
        
        char prevC = '/', nextC;
        
        // 大写、小写字母、数字、特殊字符
        bool lower = false, upper = false, number = false, special = false;
        
        for(int i = 0; i < password.size(); i++){
          nextC = password[i];
          
          if(prevC == nextC){
            // 连续出现相同字符则直接返回
            return false;
          }else if('a' <= nextC && 'z' >= nextC){
            lower = true;
          }else if('A' <= nextC && 'Z' >= nextC){
            upper = true;
          }else if('0' <= nextC && '9' >= nextC){
            number = true;
          }else if(!special){
            // 记录特殊字符
            int ind = specialStr.find(nextC);
            
            // 如果找到则ind为对应位置的下标
            if(ind >= 0 && ind < specialStr.size()){
              special = true;  
            }            
          }            
          
          // 记录当前字符
          prevC = nextC;
        }
      
        return (lower & upper & number & special);
    }
};