problem link : https://leetcode.com/problems/number-of-visible-people-in-a-queue/ approach for the above mentioned question when duplicates are allowed
eg test case : 11 6 7 5 11 11 o/p : 3 2 2 1 1 0
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
7 | adamant | 154 |
9 | Um_nik | 152 |
10 | djm03178 | 146 |
problem link : https://leetcode.com/problems/number-of-visible-people-in-a-queue/ approach for the above mentioned question when duplicates are allowed
eg test case : 11 6 7 5 11 11 o/p : 3 2 2 1 1 0
Название |
---|
Looks solvable with an increasing stack
ok
I looked at the question again and it's supposed to be a decreasing stack not an increasing stack. My solution for original qn (in Python)
class Solution:
____def canSeePersonsCount(self, heights: List[int]) -> List[int]:
________a = heights
________n = len(a)
________stack = [] # decreasing stack
________ans = [-1] * n
________for i in range(n — 1, -1, -1):
____________cnt = 0
____________while len(stack) > 0 and a[stack[-1]] < a[i]:
________________cnt += 1
________________stack.pop()
____________if len(stack) > 0:
________________ans[i] = cnt + 1
____________else:
________________ans[i] = cnt
____________stack.append(i)
________return ans
If you want to work with duplicated elements, at a[i] you need to add an additional factor k — 1 if the last element in stack after popping is also a[i]. k is the number of elements in the stack equivalent to a[i], which you can binary search since the stack is decreasing.
Sorry my described method for duplicate cases won't work. You need to handle cases like 5 3 3 4 4 3 3 4 4 5. Maybe a decreasing stack storing [value, counts] might work. You'll need to figure out how to merge the counts for repeated elements and to add the counts when popping off the stack.
Hey Sandeep,
What is your solution for the case when all heights are different? I think [this solution] for example, (https://leetcode.com/problems/number-of-visible-people-in-a-queue/discuss/1961776/Number-of-Visible-People-in-a-Queue) should work in both cases.
It is Not working , when duplicates heights are given :|
I think it should work. The person 'i' cannot see anything beyond person 'j' if heights[i] <= heights[j]. The expected result for your example is '3 1 2 1 1 0'. I think you have a typo for the second number, right?
Notice, that LeetCode rejects inputs with repeated elements, but this does not mean the solution does not work.