Sword finger offer II 099 Sum of minimum paths - double hundred code

The finger of the sword Offer II 099. Sum of minimum paths

Given a... That contains a nonnegative integer m x n grid grid , Please find a path from the top left corner to the bottom right corner , Make the sum of the numbers on the path the smallest .

explain ： A robot can only move down or right one step at a time .

Example 1：

Input ：grid = [[1,3,1],[1,5,1],[4,2,1]]
Output ：7
explain ： Because the path 1→3→1→1→1 The sum of is the smallest .

Example 2：

Input ：grid = [[1,2,3],[4,5,6]]
Output ：12

The key to solving this problem is to know , Each point is obtained from the upper point or the left point
The solution code is as follows ：

int minPathSum(int** grid, int gridSize, int* gridColSize){
    
    int i,j;
    int n=gridSize,m=gridColSize[0];
     // printf("nm %d %d || ",n,m);
      int k=fmin(m,n);
    for(i=0;i<k;i++){
    
        
        for(j=i;j<m;j++){
    
         // printf("%d %d ",i,j);
            if(j==0&&i==0){
    
                continue;
            }
            if(i==0){
    
                    grid[i][j]=grid[i][j-1]+ grid[i][j];

              }
         else{
    
                if(grid[i][j-1]<grid[i-1][j]){
    
                     grid[i][j]=grid[i][j]+grid[i][j-1];

               }
                else{
    
                     grid[i][j]=grid[i][j]+grid[i-1][j];

               }
         }
    // printf("%d %d %d ",i,j,grid[i][j]);

        
        }
          for(j=i+1;j<n;j++){
    
               
            
                if(i==0){
    
                        grid[j][i]=grid[j-1][i]+ grid[j][i];

                }
            else{
    
                    if(grid[j][i-1]<grid[j-1][i]){
    
                        grid[j][i]=grid[j][i]+grid[j][i-1];

                }
                    else{
    
                        grid[j][i]=grid[j][i]+grid[j-1][i];

                }
            }
          // printf("-%d %d %d " ,j,i,grid[j][i]);

          }
    }
    return grid[n-1][m-1];


}