LeetCode week 17 ： Number of Atoms

题目

地址： https://leetcode.com/problems/number-of-atoms/description/
类别： Stack
难度： Hard
描述：

Given a chemical formula (given as a string), return the count of each atom.

An atomic element always starts with an uppercase character, then zero or more lowercase letters, representing the name.

1 or more digits representing the count of that element may follow if the count is greater than 1. If the count is 1, no digits will follow. For example, H2O and H2O2 are possible, but H1O2 is impossible.

Two formulas concatenated together produce another formula. For example, H2O2He3Mg4 is also a formula.

A formula placed in parentheses, and a count (optionally added) is also a formula. For example, (H2O2) and (H2O2)3 are formulas.

Given a formula, output the count of all elements as a string in the following form: the first name (in sorted order), followed by its count (if that count is more than 1), followed by the second name (in sorted order), followed by its count (if that count is more than 1), and so on.

Example 1:

Input: 
formula = "H2O"
Output: "H2O"
Explanation: 
The count of elements are {'H': 2, 'O': 1}.

Example 2:

Input: 
formula = "Mg(OH)2"
Output: "H2MgO2"
Explanation: 
The count of elements are {'H': 2, 'Mg': 1, 'O': 2}.

Example 3:

Input: 
formula = "K4(ON(SO3)2)2"
Output: "K4N2O14S4"
Explanation: 
The count of elements are {'K': 4, 'N': 2, 'O': 14, 'S': 4}.

Note:

All atom names consist of lowercase letters, except for the first character which is uppercase.
The length of formula will be in the range [1, 1000].
formula will only consist of letters, digits, and round parentheses, and is a valid formula as defined in the problem.

分析

求给定分子式的各元素原子个数：
例：

Input: 
K4(ON(SO3)2)2

各元素原子个数：

K = 4
O = 2 + 3*2*2 = 14
N = 2
S = 2*2 = 4

最后再按字母顺序排序输出：

Output: K4N2O14S4

思路

这个跟求表达式的值问题很相似，我们可以考虑利用栈来进行计算：

遍历字符串：

• 遇到‘（’或刚开始遍历，栈顶新建一个map，并在遇到‘）’前将所有元素的(元素，原子数)键值对压入此map中；
• 遇到‘）’，将栈顶map的所有(元素，原子数)键值对进行计算并与下一层map进行合并且合并完后删除栈顶map。例如栈顶map和栈顶下一层map都有氧原子(O, n1)与(O，n2)且‘）’后面数字为m，则合并后的氧原子键值对=(O, n1*m+n2);
• 遇到原子，计算出其键值对后压入栈顶map。

到最后只剩下一个map，且该map包含所有元素键值对，又因map结构特性所以顺序遍历即是按字母顺序索引。
例：formula = “K4(ON(SO3)2)2”

代码：

class Solution {
public:
    string countOfAtoms(string formula) {
        stack<map<string, int>> s;
        s.emplace();
        for (int i = 0; i < formula.size();) {
            if (formula[i] == '(') {
                s.emplace();
                i++;
            } else if (formula[i] == ')') {
                i++;
                map<string, int> topMap(std::move(s.top())); s.pop();
                int num = 0;
                while (isdigit(formula[i])) num = 10 * num + (formula[i++] - '0');
                for (auto && atom : topMap)
                    s.top()[atom.first] += num * atom.second;
            } else {
                string atom(1, formula[i++]);
                while(islower(formula[i])) atom = atom + formula[i++];
                int num = 0;
                while (isdigit(formula[i])) num = 10 * num + (formula[i++] - '0');
                s.top()[atom] += (num ? num : 1);
            }
        }

        string result;
        for (auto && atom : s.top()) {
            result += atom.first;
            if (atom.second > 1) result += to_string(atom.second);
        }
        return result;
    }
};