feat: add solutions to lc problem: No.1944

solution/1900-1999/1944.Number of Visible People in a Queue/README.md

@@ -53,14 +53,31 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+单调栈。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def canSeePersonsCount(self, heights: List[int]) -> List[int]:
+        n = len(heights)
+        ans = [0] * n
+        stack = list()
+
+        for i in range(n - 1, -1, -1):
+            while stack:
+                ans[i] += 1;
+                if heights[i] > stack[-1]:
+                    stack.pop()
+                else:
+                    break
+            stack.append(heights[i])
+
+        return ans
 ```
 
 ### **Java**
@@ -71,10 +88,28 @@
 
 ```
 
-### **...**
-
-```
-
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> canSeePersonsCount(vector<int>& heights) {
+        int n = heights.size();
+        vector<int> ans(n);
+        stack<int> stk;
+        for (int i = n  - 1; i >= 0; --i)
+        {
+            while (!stk.empty())
+            {
+                ans[i]++;
+                if (heights[i] <= stk.top()) break;
+                stk.pop();
+            }
+            stk.push(heights[i]);
+        }
+        return ans;
+    }
+};
 ```
 
 <!-- tabs:end -->

solution/1900-1999/1944.Number of Visible People in a Queue/README_EN.md

@@ -47,12 +47,29 @@ Person 5 can see no one since nobody is to the right of them.
 
 ## Solutions
 
+Monotonic stack.
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def canSeePersonsCount(self, heights: List[int]) -> List[int]:
+        n = len(heights)
+        ans = [0] * n
+        stack = list()
+
+        for i in range(n - 1, -1, -1):
+            while stack:
+                ans[i] += 1;
+                if heights[i] > stack[-1]:
+                    stack.pop()
+                else:
+                    break
+            stack.append(heights[i])
+
+        return ans
 ```
 
 ### **Java**
@@ -61,10 +78,28 @@ Person 5 can see no one since nobody is to the right of them.
 
 ```
 
-### **...**
-
-```
-
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> canSeePersonsCount(vector<int>& heights) {
+        int n = heights.size();
+        vector<int> ans(n);
+        stack<int> stk;
+        for (int i = n  - 1; i >= 0; --i)
+        {
+            while (!stk.empty())
+            {
+                ans[i]++;
+                if (heights[i] <= stk.top()) break;
+                stk.pop();
+            }
+            stk.push(heights[i]);
+        }
+        return ans;
+    }
+};
 ```
 
 <!-- tabs:end -->

solution/1900-1999/1944.Number of Visible People in a Queue/Solution.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    vector<int> canSeePersonsCount(vector<int>& heights) {
+        int n = heights.size();
+        vector<int> ans(n);
+        stack<int> stk;
+        for (int i = n  - 1; i >= 0; --i)
+        {
+            while (!stk.empty())
+            {
+                ans[i]++;
+                if (heights[i] <= stk.top()) break;
+                stk.pop();
+            }
+            stk.push(heights[i]);
+        }
+        return ans;
+    }
+};

solution/1900-1999/1944.Number of Visible People in a Queue/Solution.py

@@ -0,0 +1,16 @@
+class Solution:
+    def canSeePersonsCount(self, heights: List[int]) -> List[int]:
+        n = len(heights)
+        ans = [0] * n
+        stack = list()
+
+        for i in range(n - 1, -1, -1):
+            while stack:
+                ans[i] += 1;
+                if heights[i] > stack[-1]:
+                    stack.pop()
+                else:
+                    break
+            stack.append(heights[i])
+
+        return ans