Add new solutions

Author: bigxiang

1963.minimum-number-of-swaps-to-make-the-string-balanced/default.rb

@@ -0,0 +1,73 @@
+#
+# @lc app=leetcode.cn id=1963 lang=ruby
+# @lcpr version=30204
+#
+# [1963] 使字符串平衡的最小交换次数
+#
+
+
+# @lcpr-template-start
+
+# @lcpr-template-end
+# @lc code=start
+# @param {String} s
+# @return {Integer}
+def min_swaps(s)
+  count = 0
+  left = 0
+  right = s.length - 1
+  left_stack = []
+  right_stack = []
+  while left < right
+    if s[left] == '['
+      left_stack.push(s[left])
+      left += 1
+      next
+    end
+
+    if s[left] == ']' && left_stack.last == '['
+      left_stack.pop
+      left += 1
+      next
+    end
+
+    if s[right] == ']'
+      right_stack.push(s[right])
+      right -= 1
+      next
+    end
+
+    if s[right] == '[' && right_stack.last == ']'
+      right_stack.pop
+      right -= 1
+      next
+    end
+
+    s[left], s[right] = s[right], s[left]
+    count += 1
+  end
+
+  count
+end
+# @lc code=end
+
+
+
+#
+# @lcpr case=start
+# "][]["\n
+# @lcpr case=end
+
+# @lcpr case=start
+# "]]][[["\n
+# @lcpr case=end
+
+# @lcpr case=start
+# "[]"\n
+# @lcpr case=end
+
+# @lcpr case=start
+# "[]][[[]]]]][[[[]]]]]]]]][[[[[[[["\n
+# @lcpr case=end
+#
+

2269.find-the-k-beauty-of-a-number/default.rb

@@ -0,0 +1,61 @@
+#
+# @lc app=leetcode.cn id=2269 lang=ruby
+# @lcpr version=30204
+#
+# [2269] 找到一个数字的 K 美丽值
+#
+
+
+# @lcpr-template-start
+
+# @lcpr-template-end
+# @lc code=start
+# @param {Integer} num
+# @param {Integer} k
+# @return {Integer}
+def divisor_substrings(num, k)
+  count = 0
+  digits = Math.log10(num).to_i + 1
+  (0..digits - k).each do |i|
+    pre_divisor = 10**(digits - i)
+    suf_divisor = 10**(digits - k - i)
+
+    divisor = (num % pre_divisor) / suf_divisor
+    next if divisor.zero?
+
+    count += 1 if num % divisor == 0
+  end
+
+  count
+end
+# @lc code=end
+
+
+
+#
+# @lcpr case=start
+# 240\n2\n
+# @lcpr case=end
+
+# @lcpr case=start
+# 430043\n2\n
+# @lcpr case=end
+
+# @lcpr case=start
+# 12211213\n1\n
+# @lcpr case=end
+
+# @lcpr case=start
+# 12211213\n5\n
+# @lcpr case=end
+
+# @lcpr case=start
+# 10\n1\n
+# @lcpr case=end
+
+# @lcpr case=start
+# 100000\n2\n
+# @lcpr case=end
+
+#
+

2614.prime-in-diagonal/default.rb

@@ -0,0 +1,48 @@
+#
+# @lc app=leetcode.cn id=2614 lang=ruby
+# @lcpr version=30204
+#
+# [2614] 对角线上的质数
+#
+
+
+# @lcpr-template-start
+
+# @lcpr-template-end
+# @lc code=start
+# @param {Integer[][]} nums
+# @return {Integer}
+def diagonal_prime(nums)
+  max = 0
+  (0...nums.length).each do |i|
+    max = [max, nums[i][i]].max if prime?(nums[i][i])
+    max = [max, nums[i][nums.length - 1 - i]].max if prime?(nums[i][nums.length - 1 - i])
+  end
+  max
+end
+
+def prime?(num)
+  return false if num < 2
+  return true if num < 4
+
+  (2..Math.sqrt(num).to_i).each do |i|
+    return false if num % i == 0
+  end
+
+  true
+end
+# @lc code=end
+
+
+
+#
+# @lcpr case=start
+# [[1,2,3],[5,6,7],[9,10,11]]\n
+# @lcpr case=end
+
+# @lcpr case=start
+# [[1,2,3],[5,17,7],[9,11,10]]\n
+# @lcpr case=end
+
+#
+

3110.score-of-a-string/default.rb

@@ -0,0 +1,45 @@
+#
+# @lc app=leetcode.cn id=3110 lang=ruby
+# @lcpr version=30204
+#
+# [3110] 字符串的分数
+#
+
+
+# @lcpr-template-start
+
+# @lcpr-template-end
+# @lc code=start
+# @param {String} s
+# @return {Integer}
+def score_of_string(s)
+  score = 0
+  (0...s.length - 1).each do |i|
+    score += (s[i].ord - s[i + 1].ord).abs
+  end
+
+  score
+end
+# @lc code=end
+
+
+
+#
+# @lcpr case=start
+# "hello"\n
+# @lcpr case=end
+
+# @lcpr case=start
+# "zaz"\n
+# @lcpr case=end
+
+# @lcpr case=start
+# "aa"\n
+# @lcpr case=end
+
+# @lcpr case=start
+# "aabaccjlkdjfaosidfujadflsadjflksjaflkfjlkafsfalskkcxvhiudfytwe"\n
+# @lcpr case=end
+
+#
+

3340.check-balanced-string/default.rb

@@ -0,0 +1,37 @@
+#
+# @lc app=leetcode.cn id=3340 lang=ruby
+# @lcpr version=30204
+#
+# [3340] 检查平衡字符串
+#
+
+
+# @lcpr-template-start
+
+# @lcpr-template-end
+# @lc code=start
+# @param {String} num
+# @return {Boolean}
+def is_balanced(num)
+  odd_sum = 0
+  even_sum = 0
+  (0...num.length).each do |i|
+    i % 2 == 0 ? even_sum += num[i].to_i : odd_sum += num[i].to_i
+  end
+  odd_sum == even_sum
+end
+# @lc code=end
+
+
+
+#
+# @lcpr case=start
+# "1234"\n
+# @lcpr case=end
+
+# @lcpr case=start
+# "24123"\n
+# @lcpr case=end
+
+#
+