Merge pull request #633 from fartem/2460_Apply_Operations_to_an_Array

2024-05-28 v. 5.7.6: added "2460. Apply Operations to an Array"

Author: fartem

README.md

@@ -436,3 +436,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 2441. Largest Positive Integer That Exists With Its Negative       | [Link](https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative/)       | [Link](./lib/easy/2441_largest_positive_integer_that_exists_with_its_negative.rb)       |
 | 2446. Determine if Two Events Have Conflict                        | [Link](https://leetcode.com/problems/determine-if-two-events-have-conflict/)                        | [Link](./lib/easy/2446_determine_if_two_events_have_conflict.rb)                        |
 | 2455. Average Value of Even Numbers That Are Divisible by Three    | [Link](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/)    | [Link](./lib/easy/2455_average_value_of_even_numbers_that_are_divisible_by_three.rb)    |
+| 2460. Apply Operations to an Array                                 | [Link](https://leetcode.com/problems/apply-operations-to-an-array/)                                 | [Link](./lib/easy/2460_apply_operations_to_an_array.rb)                                 |

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.7.5'
+  s.version = '5.7.6'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[bin/leetcode-ruby README.md LICENSE]
   s.executable = 'leetcode-ruby'

lib/easy/2460_apply_operations_to_an_array.rb

@@ -0,0 +1,32 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/apply-operations-to-an-array/
+# @param {Integer[]} nums
+# @return {Integer[]}
+def apply_operations(nums)
+  n = nums.length
+  result = ::Array.new(n, 0)
+
+  return result if n.zero?
+
+  p = 0
+  (0...(n - 1)).each do |i|
+    curr = nums[i]
+
+    if curr == nums[i + 1] && curr.positive?
+      nums[i] *= 2
+      result[p] = nums[i]
+      nums[i + 1] = 0
+
+      p += 1
+    elsif curr.positive?
+      result[p] = curr
+
+      p += 1
+    end
+  end
+
+  result[p] = nums.last if nums.last.positive?
+
+  result
+end

test/easy/test_2460_apply_operations_to_an_array.rb

@@ -0,0 +1,12 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/easy/2460_apply_operations_to_an_array'
+require 'minitest/autorun'
+
+class ApplyOperationsToAnArrayTest < ::Minitest::Test
+  def test_default
+    assert_equal([1, 4, 2, 0, 0, 0], apply_operations([1, 2, 2, 1, 1, 0]))
+    assert_equal([1, 0], apply_operations([0, 1]))
+  end
+end