LeetCode/Scripts/72.cpp at master · zzz0906/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
#include <iostream>
#include <stdio.h>
#include <string>
#include <stack>
using namespace std;
class Solution {
public:
    int minDistance(string word1, string word2) {
        int f [word1.size()+2][word2.size()+2];
        int c [word1.size()+2][word2.size()+2];
        memset(f, 0, sizeof(f));
        memset(c, 0, sizeof(f));
        //up 1 oblique 2 left 3
        for (int i = 0; i < word1.size();i++)
            if (word1[i] == word2[0]){
                f[i][0] = 1;
                c[i][0] = 0;
            }else{
                if (i == 0)
                    continue;
                if (f[i-1][0] > f[i][0]){
                    f[i][0] = f[i-1][0];
                    c[i][0] = 1;
                }
            }
        for (int i = 0; i < word2.size();i++)
            if (word1[0] == word2[i]){
                f[0][i] = 1;
                c[i][0] = 0;
            }
            else{
                if (i == 0)
                    continue;
                if (f[0][i-1] > f[0][i]){
                    f[0][i] = f[0][i-1];
                    c[i][0] = 3;
                }
            }
        for (int i = 1; i < word1.length();i++){
            for (int j = 1; j < word2.length();j++){
                if (word1[i] == word2[j]){
                    f[i][j] = f[i-1][j-1]+1;
                    c[i][j] = 2;
                }
                else if (f[i-1][j] > f[i][j-1]){
                    f[i][j] = f[i-1][j];
                    c[i][j] = 1;
                }else{
                    f[i][j] = f[i][j-1];
                    c[i][j] = 3;
                }
            }
        }
        pair<int,int> pos [max(word1.size(), word2.size())];
        int currentx = word1.size()-1;
        int currenty = word2.size()-1;
        int index = 0;
        while (c[currentx][currenty] != 0){
            if (c[currentx][currenty] == 0 || c[currentx][currenty] == 2){
                pos[index] = pair<int,int>(currentx,currenty);
                index++;
            }
            //cout<<currentx<<currenty<<endl;
            if (c[currentx][currenty] == 2){
                currentx--;currenty--;
            }
            else if (c[currentx][currenty] == 1)
                currentx--;
            else if (c[currentx][currenty] == 3)
                currenty--;

        }
        if (c[currentx][currenty] == 0 || c[currentx][currenty] == 2){
                pos[index] = pair<int,int>(currentx,currenty);
                index++;
        }
        //final position
        for (int i = 0; i <index;i++)
            cout<<pos[i].first<<pos[i].second<<endl;
        int lastforor = 0;
        int lastfortarget = 0;
        int cost = 0;
        for (int i = 0; i <index; i++){
            int modifyle = pos[i].second - lastfortarget;
            int orgle = pos[i].first - lastforor;
            if (modifyle == orgle){
                cost+=modifyle;
            }else{
                cost+=modifyle + abs(modifyle-orgle);
            }
            lastfortarget = pos[i].second+1;
            lastforor = pos[i].first+1;
        }
        int modifyle = (word2.size()-1)-(pos[index-1].second);
        int orgle = (word1.size()-1)-(pos[index-1].first);
        if (modifyle == orgle){
            cost+=modifyle;
        }else{
            cost+=modifyle + abs(modifyle-orgle);
        }
        // we get the LCS and its position.
        // Then we need to conduct edit distance
        return cost;
    }
};
int main(){
    Solution s;
    cout<<s.minDistance("intention","execution")<<endl;
    // 3 + 1 + 3 = 7

}