- Notifications
You must be signed in to change notification settings - Fork 4
/
Copy path0334-increasing-triplet-subsequence.rb
54 lines (45 loc) · 1.29 KB
/
0334-increasing-triplet-subsequence.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
# frozen_string_literal: true
# 334. Increasing Triplet Subsequence
# https://leetcode.com/problems/increasing-triplet-subsequence
# Medium
=begin
Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.
Example 1:
Input: nums = [1,2,3,4,5]
Output: true
Explanation: Any triplet where i < j < k is valid.
Example 2:
Input: nums = [5,4,3,2,1]
Output: false
Explanation: No triplet exists.
Example 3:
Input: nums = [2,1,5,0,4,6]
Output: true
Explanation: The triplet (3, 4, 5) is valid because nums[3] == 0 < nums[4] == 4 < nums[5] == 6.
Constraints:
* 1 <= nums.length <= 5 * 105
* -231 <= nums[i] <= 231 - 1
=end
# @param {Integer[]} nums
# @return {Boolean}
defincreasing_triplet(nums)
min=Float::INFINITY
mid=Float::INFINITY
nums.eachdo |x|
nextmin=xifx <= min
nextmid=xifx <= mid
returntrue
end
false
end
# **************** #
# TEST #
# **************** #
require"test/unit"
classTest_increasing_triplet < Test::Unit::TestCase
deftest_
assert_equaltrue,increasing_triplet([1,2,3,4,5])
assert_equalfalse,increasing_triplet([5,4,3,2,1])
assert_equaltrue,increasing_triplet([2,1,5,0,4,6])
end
end