6095. Strong password checker II

Loop through each character to judge , For special characters , Directly use a string to store , utilize find Method to judge whether there is

class Solution {
public:
    bool strongPasswordCheckerII(string password) {
        if(password.size() < 8){
          return false;
        }
      
        //  It is convenient to judge whether special characters exist later 
        string specialStr = "[email protected]#$%^&*()-+";
        
        char prevC = '/', nextC;
        
        //  Capitalization 、 Lowercase letters 、 Numbers 、 Special characters 
        bool lower = false, upper = false, number = false, special = false;
        
        for(int i = 0; i < password.size(); i++){
          nextC = password[i];
          
          if(prevC == nextC){
            //  If the same character appears continuously, it will return directly 
            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){
            //  Record special characters 
            int ind = specialStr.find(nextC);
            
            //  If found, then ind Is the subscript of the corresponding position 
            if(ind >= 0 && ind < specialStr.size()){
              special = true;  
            }            
          }            
          
          //  Record current character 
          prevC = nextC;
        }
      
        return (lower & upper & number & special);
    }
};