LeetCode (E)

Edit Distance

 

AC Rate: 199/772

My Submissions

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)

You have the following 3 operations permitted on a word:

a) Insert a character
b) Delete a character
c) Replace a character

class Solution {
public:
	int minDistance(string word1, string word2) {
		const int len1 = word1.length(), len2 = word2.length();
		vector<vector<int> > dp(len1 + 1);
		for (int i = 0; i <= len1; ++i)
			dp[i].resize(len2 + 1, 0);
		for (int i = 1; i <= len1; ++i)
			dp[i][0] = i;
		for (int j = 1; j <= len2; ++j)
			dp[0][j] = j;
		for (int i = 1; i <= len1; ++i) {
			for (int j = 1; j <= len2; ++j) {
				dp[i][j] = INT_MAX;
				dp[i][j] = min(dp[i][j], dp[i - 1][j] + 1);
				dp[i][j] = min(dp[i][j], dp[i][j - 1] + 1);
				dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + (word1[i - 1] != word2[j - 1]));
			}
		}
		return dp[len1][len2];
	}
};

Evaluate Reverse Polish Notation

  Total Accepted: 1343  Total Submissions: 6937 My Submissions

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +, -, *, /. Each operand may be an integer or another expression.

Some examples:

  ["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9
  ["4", "13", "5", "/", "+"] -> (4 + (13 / 5)) -> 6

class Solution {
public:
        int evalRPN(vector<string> &tokens) {
                const int n = tokens.size();
                stack<int> num;
                int a, b;
                for (int i = 0; i < n; ++i) {
                        if (tokens[i][0] == '+') {
                                a = num.top();
                                num.pop();
                                b = num.top();
                                num.pop();
                                num.push(b + a);
                        }
                        else if (tokens[i][0] == '-' && tokens[i].length() == 1) {
                                a = num.top();
                                num.pop();
                                b = num.top();
                                num.pop();
                                num.push(b - a);
                        }
                        else if (tokens[i][0] == '*') {
                                a = num.top();
                                num.pop();
                                b = num.top();
                                num.pop();
                                num.push(b * a);
                        }
                        else if (tokens[i][0] == '/') {
                                a = num.top();
                                num.pop();
                                b = num.top();
                                num.pop();
                                num.push(b / a);
                        }
                        else {
                                istringstream(tokens[i]) >> a;
                                num.push(a);
                        }
                }
                return num.top();
        }
};