Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
The table of contents is too big for display.
Diff view
Diff view
  •  
  •  
  •  
2 changes: 1 addition & 1 deletion leetcode-ruby.gemspec
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@ require 'English'
::Gem::Specification.new do |s|
s.required_ruby_version = '>= 3.0'
s.name = 'leetcode-ruby'
s.version = '6.5.1'
s.version = '6.5.1.1'
s.license = 'MIT'
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
s.executable = 'leetcode-ruby'
Expand Down
7 changes: 3 additions & 4 deletions test/easy/test_1002_find_common_characters.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,8 +5,7 @@
require 'minitest/autorun'

class FindCommonCharactersTest < ::Minitest::Test
def test_default
assert_equal(%w[e l l], common_chars(%w[bella label roller]))
assert_equal(%w[c o], common_chars(%w[cool lock cook]))
end
def test_default_one = assert_equal(%w[e l l], common_chars(%w[bella label roller]))

def test_default_two = assert_equal(%w[c o], common_chars(%w[cool lock cook]))
end
10 changes: 5 additions & 5 deletions test/easy/test_1005_maximize_sum_of_array_after_k_negations.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,9 +5,9 @@
require 'minitest/autorun'

class MaximizeSumOfArrayAfterKNegationsTest < ::Minitest::Test
def test_default
assert_equal(5, largest_sum_after_k_negations([4, 2, 3], 1))
assert_equal(6, largest_sum_after_k_negations([3, -1, 0, 2], 3))
assert_equal(13, largest_sum_after_k_negations([2, -3, -1, 5, -4], 2))
end
def test_default_one = assert_equal(5, largest_sum_after_k_negations([4, 2, 3], 1))

def test_default_two = assert_equal(6, largest_sum_after_k_negations([3, -1, 0, 2], 3))

def test_default_three = assert_equal(13, largest_sum_after_k_negations([2, -3, -1, 5, -4], 2))
end
10 changes: 5 additions & 5 deletions test/easy/test_1009_complement_of_base_10_integer.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,9 +5,9 @@
require 'minitest/autorun'

class ComplementOfBase10IntegerTest < ::Minitest::Test
def test_default
assert_equal(2, bitwise_complement(5))
assert_equal(0, bitwise_complement(7))
assert_equal(5, bitwise_complement(10))
end
def test_default_one = assert_equal(2, bitwise_complement(5))

def test_default_two = assert_equal(0, bitwise_complement(7))

def test_default_three = assert_equal(5, bitwise_complement(10))
end
8 changes: 7 additions & 1 deletion test/easy/test_100_same_tree.rb
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@
require 'minitest/autorun'

class SameTreeTest < ::Minitest::Test
def test_default
def test_default_one
assert(
is_same_tree(
::TreeNode.new(
Expand All @@ -21,6 +21,9 @@ def test_default
)
)
)
end

def test_default_two
assert(
!is_same_tree(
::TreeNode.new(
Expand All @@ -32,6 +35,9 @@ def test_default
)
)
)
end

def test_default_three
assert(
!is_same_tree(
::TreeNode.new(
Expand Down
15 changes: 12 additions & 3 deletions test/easy/test_1018_binary_prefix_divisible_by_5.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,8 +5,17 @@
require 'minitest/autorun'

class BinaryPrefixDivisibleBy5Test < ::Minitest::Test
def test_default
assert_equal([true, false, false], prefixes_div_by5([0, 1, 1]))
assert_equal([false, false, false], prefixes_div_by5([1, 1, 1]))
def test_default_one
assert_equal(
[true, false, false],
prefixes_div_by5([0, 1, 1])
)
end

def test_default_two
assert_equal(
[false, false, false],
prefixes_div_by5([1, 1, 1])
)
end
end
5 changes: 4 additions & 1 deletion test/easy/test_101_symmetric_tree.rb
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@
require 'minitest/autorun'

class SymmetricTreeTest < ::Minitest::Test
def test_default
def test_default_one
assert(
is_symmetric(
::TreeNode.new(
Expand All @@ -24,6 +24,9 @@ def test_default
)
)
)
end

def test_default_two
assert(
!is_symmetric(
::TreeNode.new(
Expand Down
23 changes: 19 additions & 4 deletions test/easy/test_1021_remove_outermost_parentheses.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,9 +5,24 @@
require 'minitest/autorun'

class RemoveOutermostParenthesesTest < ::Minitest::Test
def test_default
assert_equal('()()()', remove_outer_parentheses('(()())(())'))
assert_equal('()()()()(())', remove_outer_parentheses('(()())(())(()(()))'))
assert_equal('', remove_outer_parentheses('()()'))
def test_default_one
assert_equal(
'()()()',
remove_outer_parentheses('(()())(())')
)
end

def test_default_two
assert_equal(
'()()()()(())',
remove_outer_parentheses('(()())(())(()(()))')
)
end

def test_default_three
assert_equal(
'',
remove_outer_parentheses('()()')
)
end
end
5 changes: 4 additions & 1 deletion test/easy/test_1022_sum_of_root_to_leaf_binary_numbers.rb
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@
require 'minitest/autorun'

class SumOfRootToLeafBinaryNumbersTest < ::Minitest::Test
def test_default
def test_default_one
assert_equal(
22,
sum_root_to_leaf(
Expand All @@ -25,6 +25,9 @@ def test_default
)
)
)
end

def test_default_two
assert_equal(
0,
sum_root_to_leaf(
Expand Down
7 changes: 3 additions & 4 deletions test/easy/test_1025_divisor_game.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,8 +5,7 @@
require 'minitest/autorun'

class DivisorGameTest < ::Minitest::Test
def test_default
assert(divisor_game(2))
assert(!divisor_game(3))
end
def test_default_one = assert(divisor_game(2))

def test_default_two = assert(!divisor_game(3))
end
7 changes: 3 additions & 4 deletions test/easy/test_1046_last_stone_weight.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,8 +5,7 @@
require 'minitest/autorun'

class LastStoneWeightTest < ::Minitest::Test
def test_default
assert_equal(1, last_stone_weight([2, 7, 4, 1, 8, 1]))
assert_equal(1, last_stone_weight([1]))
end
def test_default_one = assert_equal(1, last_stone_weight([2, 7, 4, 1, 8, 1]))

def test_default_two = assert_equal(1, last_stone_weight([1]))
end
Original file line number Diff line number Diff line change
Expand Up @@ -5,8 +5,7 @@
require 'minitest/autorun'

class RemoveAllAdjacentDuplicatesInStringTest < ::Minitest::Test
def test_default
assert_equal('ca', remove_duplicates_all('abbaca'))
assert_equal('ay', remove_duplicates_all('azxxzy'))
end
def test_default_one = assert_equal('ca', remove_duplicates_all('abbaca'))

def test_default_two = assert_equal('ay', remove_duplicates_all('azxxzy'))
end
5 changes: 4 additions & 1 deletion test/easy/test_104_maximum_depth_of_binary_tree.rb
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@
require 'minitest/autorun'

class MaximumDepthOfBinaryTreeTest < ::Minitest::Test
def test_default
def test_default_one
assert_equal(
3,
max_depth(
Expand All @@ -21,6 +21,9 @@ def test_default
)
)
)
end

def test_default_two
assert_equal(
2,
max_depth(
Expand Down
10 changes: 5 additions & 5 deletions test/easy/test_1051_height_checker.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,9 +5,9 @@
require 'minitest/autorun'

class HeightCheckerTest < ::Minitest::Test
def test_default
assert_equal(3, height_checker([1, 1, 4, 2, 1, 3]))
assert_equal(5, height_checker([5, 1, 2, 3, 4]))
assert_equal(0, height_checker([1, 2, 3, 4, 5]))
end
def test_default_one = assert_equal(3, height_checker([1, 1, 4, 2, 1, 3]))

def test_default_two = assert_equal(5, height_checker([5, 1, 2, 3, 4]))

def test_default_three = assert_equal(0, height_checker([1, 2, 3, 4, 5]))
end
10 changes: 5 additions & 5 deletions test/easy/test_1071_greatest_common_divisor_of_strings.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,9 +5,9 @@
require 'minitest/autorun'

class GreatestCommonDivisorOfStringsTest < ::Minitest::Test
def test_default
assert_equal('ABC', gcd_of_strings('ABCABC', 'ABC'))
assert_equal('AB', gcd_of_strings('ABABAB', 'ABAB'))
assert_equal('', gcd_of_strings('LEET', 'CODE'))
end
def test_default_one = assert_equal('ABC', gcd_of_strings('ABCABC', 'ABC'))

def test_default_two = assert_equal('AB', gcd_of_strings('ABABAB', 'ABAB'))

def test_default_three = assert_equal('', gcd_of_strings('LEET', 'CODE'))
end
5 changes: 4 additions & 1 deletion test/easy/test_1078_occurrences_after_bigram.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@
require 'minitest/autorun'

class OccurrencesAfterBigramTest < ::Minitest::Test
def test_default
def test_default_one
assert_equal(
%w[girl student],
find_occurrences(
Expand All @@ -14,6 +14,9 @@ def test_default
'good'
)
)
end

def test_default_two
assert_equal(
%w[we rock],
find_occurrences(
Expand Down
6 changes: 4 additions & 2 deletions test/easy/test_1089_duplicate_zeros.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,17 +5,19 @@
require 'minitest/autorun'

class DuplicateZerosTest < ::Minitest::Test
def test_default
def test_default_one
arr = [1, 0, 2, 3, 0, 4, 5, 0]
duplicate_zeros(arr)
assert_equal([1, 0, 0, 2, 3, 0, 0, 4], arr)
end

def test_default_two
arr = [1, 2, 3]
duplicate_zeros(arr)
assert_equal([1, 2, 3], arr)
end

def test_additional
def test_additional_one
arr = [8, 4, 5, 0, 0, 0, 0, 7]
duplicate_zeros(arr)
assert_equal([8, 4, 5, 0, 0, 0, 0, 0], arr)
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@
require 'minitest/autorun'

class ConvertSortedArrayToBinarySearchTreeTest < ::Minitest::Test
def test_default
def test_default_one
assert(
::TreeNode.are_equals(
::TreeNode.new(
Expand All @@ -27,14 +27,19 @@ def test_default
)
)
)
end

def test_default_two
assert(
::TreeNode.are_equals(
::TreeNode.new(
1,
nil,
::TreeNode.new(3)
),
sorted_array_to_bst([1, 3])
sorted_array_to_bst(
[1, 3]
)
)
)
end
Expand Down
7 changes: 3 additions & 4 deletions test/easy/test_1103_distribute_candies_to_people.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,8 +5,7 @@
require 'minitest/autorun'

class DistributeCandiesToPeopleTest < ::Minitest::Test
def test_default
assert_equal([1, 2, 3, 1], distribute_candies(7, 4))
assert_equal([5, 2, 3], distribute_candies(10, 3))
end
def test_default_one = assert_equal([1, 2, 3, 1], distribute_candies(7, 4))

def test_default_two = assert_equal([5, 2, 3], distribute_candies(10, 3))
end
19 changes: 14 additions & 5 deletions test/easy/test_1108_defanging_an_ip_address.rb
Original file line number Diff line number Diff line change
Expand Up @@ -5,10 +5,19 @@
require 'minitest/autorun'

class DefangingAnIPAddressTest < ::Minitest::Test
def test_default
# rubocop:disable Style/DisableCopsWithinSourceCodeDirective, Style/IpAddresses
assert_equal('1[.]1[.]1[.]1', defang_i_paddr('1.1.1.1'))
assert_equal('255[.]100[.]50[.]0', defang_i_paddr('255.100.50.0'))
# rubocop:enable Style/DisableCopsWithinSourceCodeDirective, Style/IpAddresses
# rubocop:disable Style/DisableCopsWithinSourceCodeDirective, Style/IpAddresses
def test_default_one
assert_equal(
'1[.]1[.]1[.]1',
defang_i_paddr('1.1.1.1')
)
end

def test_default_two
assert_equal(
'255[.]100[.]50[.]0',
defang_i_paddr('255.100.50.0')
)
end
# rubocop:enable Style/DisableCopsWithinSourceCodeDirective, Style/IpAddresses
end
8 changes: 6 additions & 2 deletions test/easy/test_110_balanced_binary_tree.rb
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@
require 'minitest/autorun'

class BalancedBinaryTreeTest < ::Minitest::Test
def test_default
def test_default_one
assert(
is_balanced(
::TreeNode.new(
Expand All @@ -20,6 +20,9 @@ def test_default
)
)
)
end

def test_default_two
assert(
!is_balanced(
::TreeNode.new(
Expand All @@ -37,6 +40,7 @@ def test_default
)
)
)
assert(is_balanced(nil))
end

def test_default_three = assert(is_balanced(nil))
end
Loading
Loading