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
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -678,6 +678,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
| 1310. XOR Queries of a Subarray | [Link](https://leetcode.com/problems/xor-queries-of-a-subarray/) | [Link](./lib/medium/1310_xor_queries_of_a_subarray.rb) | [Link](./test/medium/test_1310_xor_queries_of_a_subarray.rb) |
| 1315. Sum of Nodes with Even-Valued Grandparent | [Link](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/) | [Link](./lib/medium/1315_sum_of_nodes_with_even_valued_grandparent.rb) | [Link](./test/medium/test_1315_sum_of_nodes_with_even_valued_grandparent.rb) |
| 1325. Delete Leaves With a Given Value | [Link](https://leetcode.com/problems/delete-leaves-with-a-given-value/) | [Link](./lib/medium/1325_delete_leaves_with_a_given_value.rb) | [Link](./test/medium/test_1325_delete_leaves_with_a_given_value.rb) |
| 1329. Sort the Matrix Diagonally | [Link](https://leetcode.com/problems/sort-the-matrix-diagonally/) | [Link](./lib/medium/1329_sort_the_matrix_diagonally.rb) | [Link](./test/medium/test_1329_sort_the_matrix_diagonally.rb) |
| 1400. Construct K Palindrome Strings | [Link](https://leetcode.com/problems/construct-k-palindrome-strings/) | [Link](./lib/medium/1400_construct_k_palindrome_strings.rb) | [Link](./test/medium/test_1400_construct_k_palindrome_strings.rb) |
| 2116. Check if a Parentheses String Can Be Valid | [Link](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/) | [Link](./lib/medium/2116_check_if_a_parentheses_string_can_be_valid.rb) | [Link](./test/medium/test_2116_check_if_a_parentheses_string_can_be_valid.rb) |
| 2425. Bitwise XOR of All Pairings | [Link](https://leetcode.com/problems/bitwise-xor-of-all-pairings/) | [Link](./lib/medium/2425_bitwise_xor_of_all_pairings.rb) | [Link](./test/medium/test_2425_bitwise_xor_of_all_pairings.rb) |
Expand Down
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 = '8.4.5'
s.version = '8.4.6'
s.license = 'MIT'
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
s.executable = 'leetcode-ruby'
Expand Down
65 changes: 65 additions & 0 deletions lib/medium/1329_sort_the_matrix_diagonally.rb
Original file line number Diff line number Diff line change
@@ -0,0 +1,65 @@
# frozen_string_literal: true

# https://leetcode.com/problems/sort-the-matrix-diagonally/
# @param {Integer[][]} mat
# @return {Integer[][]}
def diagonal_sort(mat)
rows = mat.size
columns = mat[0].size

(0...rows).each do |row|
i = row
j = 0
diagonals = []

while i < rows && j < columns
diagonals << mat[i][j]

i += 1
j += 1
end

diagonals.sort!

i = row
j = 0
k = 0

while i < rows && j < columns
mat[i][j] = diagonals[k]

i += 1
j += 1
k += 1
end
end

(0...columns).each do |column|
i = 0
j = column
diagonals = []

while i < rows && j < columns
diagonals << mat[i][j]

i += 1
j += 1
end

diagonals.sort!

i = 0
j = column
k = 0

while i < rows && j < columns
mat[i][j] = diagonals[k]

i += 1
j += 1
k += 1
end
end

mat
end
45 changes: 45 additions & 0 deletions test/medium/test_1329_sort_the_matrix_diagonally.rb
Original file line number Diff line number Diff line change
@@ -0,0 +1,45 @@
# frozen_string_literal: true

require_relative '../test_helper'
require_relative '../../lib/medium/1329_sort_the_matrix_diagonally'
require 'minitest/autorun'

class SortTheMatrixDiagonallyTest < ::Minitest::Test
def test_diagonal_sort_small_matrix
assert_equal(
[
[1, 1, 1, 1],
[1, 2, 2, 2],
[1, 2, 3, 3]
],
diagonal_sort(
[
[3, 3, 1, 1],
[2, 2, 1, 2],
[1, 1, 1, 2]
]
)
)
end

def test_diagonal_sort_large_matrix
assert_equal(
[
[5, 17, 4, 1, 52, 7],
[11, 11, 25, 45, 8, 69],
[14, 23, 25, 44, 58, 15],
[22, 27, 31, 36, 50, 66],
[84, 28, 75, 33, 55, 68]
],
diagonal_sort(
[
[11, 25, 66, 1, 69, 7],
[23, 55, 17, 45, 15, 52],
[75, 31, 36, 44, 58, 8],
[22, 27, 33, 25, 68, 4],
[84, 28, 14, 11, 5, 50]
]
)
)
end
end