Project Euler 80：Path sum: two ways 路径和：两个方向

import time ;
import numpy as np

def run():
    filename = ‘E:/java/projecteuler/src/Level3/p081_matrix.txt‘
    data = readData(filename)
    Path_Sum(data)
    
def Path_Sum(data):
    row,col = np.shape(data)
    for i in range(1,row):
        data[0][i] = data[0][i]+data[0][i-1]
        data[i][0] = data[i][0] + data[i-1][0]
    for i in range(1,row):
        for j in range(1,col):
            data[i][j] += min(data[i-1][j],data[i][j-1])
    print data[row-1][col-1] 
    
def readData(filename):
    fl = open(filename)
    data =[]
    for row in fl:
        row = row.split(‘,‘)
        line = [int(i) for i in row]
        data.append(line)
    return data
if __name__==‘__main__‘:
    t0 = time.time()
    run()
    t1 = time.time()
    print "running time=",(t1-t0),"s"

# 427337
# running time= 0.00799989700317 s
            

package Level3;

import java.awt.List;
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;


public class PE081{
    
    static int[][] grid;
    static void run() throws IOException{
        String filename = "src/Level3/p081_matrix.txt";
        String lineString = "";
        ArrayList<String> listData = new ArrayList<String>();
        BufferedReader data = new BufferedReader(new FileReader(filename));
        while((lineString = data.readLine())!= null){
            listData.add(lineString);
        }
        // 分配大小空间的 定义的grid 没有定义大小
        assignArray(listData.size());
        // 按照行添加到数组grid中 
        for(int index = 0,row_counter=0;index <=listData.size() - 1;++index,row_counter++){
            populateArray(listData.get(index),row_counter);
        }
        System.out.println(Path_min(grid));
        
    }
    public static int Path_min(int[][] data){
        int size = data.length;
        for(int i=size -2;i>=0;--i){
            data[i][size-1] += data[i+1][size-1];
            data[size-1][i] += data[size-1][i+1];
        }
        for( int index = size -2;index >=0;index--){
            for(int innerIndex = size -2;innerIndex >=0;innerIndex--){
                data[index][innerIndex] += Math.min(data[index+1][innerIndex],
                        data[index][innerIndex+1]);
            }
        }
        return data[0][0];
    }
    // 每行的数据添加到数组中
    public static void populateArray(String str,int row){
        int counter = 0;
        String[] data = str.split(",");
        for(int index = 0;index<=data.length -1;++index){
            grid[row][counter++] = Integer.parseInt(data[index]);
        }
    }
    public static void assignArray(int no_of_row){
        grid = new int[no_of_row][no_of_row];
    }
    
    

    public static void main(String[] args) throws IOException{
        long t0 = System.currentTimeMillis();
        run();
        long t1 = System.currentTimeMillis();
        long t = t1 - t0;
        System.out.println("running time="+t/1000+"s"+t%1000+"ms");
//        427337
//        running time=0s38ms
    }
}