Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public void search_path(String [][] b, int [][] c, String s1, String s2){ //доделать
- int m = s1.length();
- int n = s2.length();
- int [][] c1 = new int[s1.length()+1][s2.length()+1];
- for (int i = 1; i <= m ; i++) c1[i][0] = i * c_d;
- for (int j = 0; j <= n ; j++) c1[0][j] = j * c_i;
- for (int i = 1; i <= m ; i++)
- for (int j = 1; j <= n ; j++)
- {
- if (s1.charAt(i-1) == s2.charAt(j-1)){
- //c1[i][j] = c1[i-1][j-1];
- b[i][j] = "diag/NOTHING";
- }
- else{
- int MIN = Math.min((c1[i][j-1]+c_i), //Insert
- Math.min((c1[i-1][j]+c_d), // Remove
- (c1[i-1][j-1]+c_r))); //Replace
- if (MIN == c1[i][j-1]+c_i){
- //c1[i][j] = c1[i][j-1];
- b[i][j] = "up/delete "+(j-1);
- }
- if (MIN == c1[i-1][j]+c_d){
- //c1[i][j] = c1[i-1][j];
- b[i][j] = "left/insert "+s2.charAt(j-1);
- }
- if (MIN == c1[i-1][j-1]+c_r){
- //c1[i][j] = c1[i-1][j-1];
- b[i][j] = "diag/replace "+i+" with "+s2.charAt(j-1);
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement