力扣581. 最短无序连续子数组；力扣150. 逆波兰表达式求值

class Solution {
public:
    int findUnsortedSubarray(vector<int>& nums) {
        vector<int> vec(nums.begin(),nums.end());
        sort(vec.begin(),vec.end());
        int i = 0;
        int j = nums.size() - 1;
        while(i <= j)
        {
            if(nums[i] != vec[i])
                break;
            ++i;
        }
        while(i <= j)
        {
            if(nums[j] != vec[j])
                break;
            --j;
        }
        return j - i + 1;

    }
};

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
	auto i = tokens.begin();
	auto j = tokens.begin();
	while (tokens.size() > 1)
	{
		if (*i != "+" && *i != "-" && *i != "*" && *i != "/")
		{
			++i;
		}
		else
		{
			j = i - 2;
			if (*i == "+")
			{
				int left = atoi((*(i - 2)).c_str());
				int right = atoi((*(i - 1)).c_str());
 				int ss = left + right;
				*(i - 2) = to_string(ss);
				tokens.erase(i - 1, i + 1);
			}
			else if (*i == "-")
			{
				int left = atoi((*(i - 2)).c_str());
				int right = atoi((*(i - 1)).c_str());
				int ss = left - right;
				*(i - 2) = to_string(ss);
				tokens.erase(i - 1, i + 1);
			}
			else if (*i == "*")
			{
				int left = atoi((*(i - 2)).c_str());
				int right = atoi((*(i - 1)).c_str());
				int ss = left * right;
				*(i - 2) = to_string(ss);
				tokens.erase(i - 1, i + 1);
			}
			else
			{
				int left = atoi((*(i - 2)).c_str());
				int right = atoi((*(i - 1)).c_str());
				int ss = left / right;
				*(i - 2) = to_string(ss);
				tokens.erase(i - 1, i + 1);
			}
			i = j;
		}
	}
	return atoi(tokens[0].c_str());
}
};