From 58b62f1c517314c824a87969a4d2e1390065c223 Mon Sep 17 00:00:00 2001 From: fartem Date: Thu, 9 May 2024 05:48:32 +0300 Subject: [PATCH] 2024-05-09 v. 5.6.4: added "2389. Longest Subsequence With Limited Sum" --- README.md | 1 + leetcode-ruby.gemspec | 2 +- ...89_longest_subsequence_with_limited_sum.rb | 30 +++++++++++++++++++ ...89_longest_subsequence_with_limited_sum.rb | 12 ++++++++ 4 files changed, 44 insertions(+), 1 deletion(-) create mode 100644 lib/easy/2389_longest_subsequence_with_limited_sum.rb create mode 100644 test/easy/test_2389_longest_subsequence_with_limited_sum.rb diff --git a/README.md b/README.md index 7eb7e995..334905ca 100644 --- a/README.md +++ b/README.md @@ -424,3 +424,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/). | 2373. Largest Local Values in a Matrix | [Link](https://leetcode.com/problems/largest-local-values-in-a-matrix/) | [Link](./lib/easy/2373_largest_local_values_in_a_matrix.rb) | | 2379. Minimum Recolors to Get K Consecutive Black Blocks | [Link](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/) | [Link](./lib/easy/2379_minimum_recolors_to_get_k_consecutive_black_blocks.rb) | | 2383. Minimum Hours of Training to Win a Competition | [Link](https://leetcode.com/problems/minimum-hours-of-training-to-win-a-competition/) | [Link](./lib/easy/2383_minimum_hours_of_training_to_win_a_competition.rb) | +| 2389. Longest Subsequence With Limited Sum | [Link](https://leetcode.com/problems/longest-subsequence-with-limited-sum/) | [Link](./lib/easy/2389_longest_subsequence_with_limited_sum.rb) | diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec index b468cc31..ed9a9da8 100644 --- a/leetcode-ruby.gemspec +++ b/leetcode-ruby.gemspec @@ -5,7 +5,7 @@ require 'English' ::Gem::Specification.new do |s| s.required_ruby_version = '>= 3.0' s.name = 'leetcode-ruby' - s.version = '5.6.3' + s.version = '5.6.4' s.license = 'MIT' s.files = ::Dir['lib/**/*.rb'] + %w[bin/leetcode-ruby README.md LICENSE] s.executable = 'leetcode-ruby' diff --git a/lib/easy/2389_longest_subsequence_with_limited_sum.rb b/lib/easy/2389_longest_subsequence_with_limited_sum.rb new file mode 100644 index 00000000..ffe6650e --- /dev/null +++ b/lib/easy/2389_longest_subsequence_with_limited_sum.rb @@ -0,0 +1,30 @@ +# frozen_string_literal: true + +# https://leetcode.com/problems/longest-subsequence-with-limited-sum/ +# @param {Integer[]} nums +# @param {Integer[]} queries +# @return {Integer[]} +def answer_queries(nums, queries) + result = [] + nums.sort! + (0...queries.length).each do |i| + sum = 0 + j = 0 + + while j < nums.length + num = nums[j] + if sum + num > queries[i] + result[i] = j + + break + end + + sum += num + j += 1 + end + + result[i] = j if j == nums.length + end + + result +end diff --git a/test/easy/test_2389_longest_subsequence_with_limited_sum.rb b/test/easy/test_2389_longest_subsequence_with_limited_sum.rb new file mode 100644 index 00000000..69b23ad9 --- /dev/null +++ b/test/easy/test_2389_longest_subsequence_with_limited_sum.rb @@ -0,0 +1,12 @@ +# frozen_string_literal: true + +require_relative '../test_helper' +require_relative '../../lib/easy/2389_longest_subsequence_with_limited_sum' +require 'minitest/autorun' + +class LongestSubsequenceWithLimitedSumTest < ::Minitest::Test + def test_default + assert_equal([2, 3, 4], answer_queries([4, 5, 2, 1], [3, 10, 21])) + assert_equal([0], answer_queries([2, 3, 4, 5], [1])) + end +end