Longest Commong Substring (Length only)

lcs.cpp

void main(){
    // 5-choose-3 
    std::size_t n =184;
    std::size_t k = 3;

    std::string s = "hello";
    std::string s2 = "llo";

    std::vector<std::vector<int>> lcs(s.length()+1, std::vector<int>(s2.length()+1));
    for( int i = 0; i < lcs.size(); ++i ){
        for( int j = 0; j < lcs[i].size(); ++j ){
            if( i == 0 || j == 0 ) lcs[i][j] = 0;
            else if( s[i] == s2[j] ){
                lcs[i][j] = lcs[i-1][j-1] + 1;
            }
        }
    }
    for( auto i : lcs ){
        for( auto j : i ){
            std::cout << j << " ";
        }
        std::cout << std::endl;
    }

    std::cout << lcs.back().back()  << std::endl;
    std::cin.get();
}