Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 452ecd3

Browse files
committed
Solve 491. Non-decreasing Subsequences
1 parent 6f1038b commit 452ecd3

File tree

1 file changed

+26
-0
lines changed

1 file changed

+26
-0
lines changed

‎04/0491-Non-decreasing_Subsequences.kt

Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
class Solution {
2+
3+
private fun findSubsequences(current: Int, currentSubsequence: MutableList<Int>, subsequences: MutableSet<List<Int>>, nums: IntArray) {
4+
if (currentSubsequence.size > 1) {
5+
subsequences.add(currentSubsequence.toList())
6+
}
7+
8+
for (i in current until nums.size) {
9+
if (!currentSubsequence.isEmpty() && nums[i] < currentSubsequence.last()) {
10+
continue
11+
}
12+
13+
currentSubsequence.add(nums[i])
14+
findSubsequences(i + 1, currentSubsequence, subsequences, nums)
15+
currentSubsequence.removeAt(currentSubsequence.size - 1)
16+
}
17+
}
18+
19+
fun findSubsequences(nums: IntArray): List<List<Int>> {
20+
val subsequences = mutableSetOf<List<Int>>()
21+
findSubsequences(0, mutableListOf(), subsequences, nums)
22+
23+
return subsequences.toList()
24+
}
25+
26+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /