1065. Index Pairs of a String

Given a string text and an array of strings words, return an array of all index pairs [i, j] so that the substring text[i...j] is in words.

Return the pairs [i, j] in sorted order (i.e., sort them by their first coordinate, and in case of ties sort them by their second coordinate).

c++

class Solution {
public:
    vector<vector<int>> indexPairs(string text, vector<string>& words) {
        vector<vector<int>> res;
        for(auto w : words) {
            if(w.length() > text.length()) continue;
            for(int i = 0; i < text.length() - w.length() + 1; i++) {
                if(text.substr(i,w.length()) == w) res.push_back({i,i+(int)w.length() - 1});
            }
        }
        sort(begin(res), end(res));
        return res;
    }
};