添加了时间复杂度和空间复杂度

Author: soulmachine

C++/LeetCodet题解(C++版).pdf

@@ -21,6 +21,7 @@ \subsubsection{分析}
 \subsubsection{代码}
 \begin{Code}
 // LeetCode, Valid Parentheses
+// 时间复杂度O(n)，空间复杂度O(n)
 class Solution {
 public:
     bool isValid (string const& s) {
@@ -70,7 +71,7 @@ \subsubsection{分析}
 \subsubsection{代码}
 \begin{Code}
 // LeetCode, Longest Valid Parenthese
-// 使用栈，复杂度 O(n)
+// 使用栈，时间复杂度O(n)，空间复杂度O(n)
 class Solution {
 public:
     int longestValidParentheses(string s) {
@@ -141,21 +142,21 @@ \subsubsection{分析}
 \subsubsection{代码}
 \begin{Code}
 // LeetCode, Largest Rectangle in Histogram
+// 时间复杂度O(n)，空间复杂度O(n)
 class Solution {
 public:
     int largestRectangleArea(vector<int> &height) {
         stack<int> s;
         height.push_back(0);
         int result = 0;
-        for (int i = 0; i < height.size(); i++) {
+        for (int i = 0; i < height.size(); ) {
             if (s.empty() || height[i] > height[s.top()])
-                s.push(i);
+                s.push(i++);
             else {
                 int tmp = s.top();
                 s.pop();
                 result = max(result,
                         height[tmp] * (s.empty() ? i : i - s.top() - 1));
-                i--;
             }
         }
         return result;