<commit_before>#include "MinimumPathSum.hpp"

#include <climits>

using namespace std;

int MinimumPathSum::minPathSum(vector<vector<int>> &grid) {
    int m = grid.size();

    if (m == 0) return 0;

    int n = grid[0].size();

    if (n == 0) return 0;

    vector<vector<int>> dp(m, vector<int>(n, INT_MAX));
    dp[0][0] = grid[0][0];
<commit_msg>Refine Problem 64. Minimum Path Sum<commit_after>#include "MinimumPathSum.hpp"

int MinimumPathSum::minPathSum(vector<vector<int>> &grid) {
    size_t m = grid.size();

    if (m == 0) return 0;

    size_t n = grid[0].size();

    if (n == 0) return 0;

    vector<vector<int>> dp(m, vector<int>(n, 0));
    dp[0][0] = grid[0][0];

{'fraction_non_alphanumeric': 0.18859649122807018, 'fraction_numerical': 0.03070175438596491, 'mean_word_length': 3.7569444444444446, 'pattern_counts': {'":': 0, '<': 14, '<?xml version=': 0, '>': 14, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1742331', 'n_tokens_mistral': 285, 'n_tokens_neox': 259, 'n_words': 64}