246. Strobogrammatic Number

public class Solution {
    public boolean isStrobogrammatic(String nums) {
        // 6 - > 9 , 9 - > 6 , 1 - > 1, 8 - > 8, 0 -> 0
        int array[] = {0, 1, 0, 0, 0, 0 ,9, 0, 8, 6};
        String res = "";
        for(int i = nums.length() - 1 ; i >= 0; i--){
            if(nums.charAt(i) - ‘0‘ >= 0 && nums.charAt(i) - ‘0‘ <= 9 ){
                res = res + array[nums.charAt(i) - ‘0‘] ;
            }
            else
                return false;
        }
        return res.equals(nums);
    } 
    
    //2 pointer O(n/2) ---method 2
    public boolean isStrobogrammatic(String nums) {
        int i = 0;
        int j = nums.length() - 1;
        while(i <= j){
           if(isPair(nums.charAt(i), nums.charAt(j))){
               i++;
               j--;
           }
           else return false;
        }
        return true;
    }
    public boolean isPair(char num1 , char num2){
        if(num1 == ‘6‘ && num2 == ‘9‘ ||
        num1 == ‘9‘ && num2 == ‘6‘ || 
        num1 == ‘8‘ && num2 == ‘8‘ ||
        num1 == ‘1‘ && num2 == ‘1‘||
        num1 == ‘0‘ && num2 == ‘0‘)  
            return true;
        else
            return false;
    }
}