1433. Check If a String Can Break Another String

Given two strings: s1 and s2 with the same size, check if some permutation of string s1 can break some permutation of string s2 or vice-versa. In other words s2 can break s1 or vice-versa.

A string x can break string y (both of size n) if x[i] >= y[i] (in alphabetical order) for all i between 0 and n-1.

class Solution {
public:
    bool checkIfCanBreak(string s1, string s2) {
        sort(begin(s1), end(s1));
        sort(begin(s2), end(s2));
        int compare = 0;
        for(int i = 0; i < s1.length(); i++) {
            if(s1[i] == s2[i]) continue;
            if(s1[i] > s2[i]) {
                if(compare == 0) compare = 1;
                else if(compare == -1) return false;
            } else {
                if(compare == 0) compare = -1;
                else if(compare == 1) return false;
            }
        }
        return true;
    }
};