Skip to content

Commit 5c9bfaf

Browse files
authored
Merge pull request #665 from fartem/33_Search_in_Rotated_Sorted_Array
2024-07-08 v. 6.0.8: added "33. Search in Rotated Sorted Array"
2 parents 14bc57d + efebef1 commit 5c9bfaf

5 files changed

+49
-1
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -473,3 +473,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
473473
| 22. Generate Parentheses | [Link](https://leetcode.com/problems/generate-parentheses/) | [Link](./lib/medium/22_generate_parentheses.rb) |
474474
| 24. Swap Nodes in Pairs | [Link](https://leetcode.com/problems/swap-nodes-in-pairs/) | [Link](./lib/medium/24_swap_nodes_in_pairs.rb) |
475475
| 29. Divide Two Integers | [Link](https://leetcode.com/problems/divide-two-integers/) | [Link](./lib/medium/29_divide_two_integers.rb) |
476+
| 33. Search in Rotated Sorted Array | [Link](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Link](./lib/medium/33_search_in_rotated_sorted_array.rb) |

leetcode-ruby.gemspec

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ require 'English'
55
::Gem::Specification.new do |s|
66
s.required_ruby_version = '>= 3.0'
77
s.name = 'leetcode-ruby'
8-
s.version = '6.0.7'
8+
s.version = '6.0.8'
99
s.license = 'MIT'
1010
s.files = ::Dir['lib/**/*.rb'] + %w[bin/leetcode-ruby README.md LICENSE]
1111
s.executable = 'leetcode-ruby'
Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
# frozen_string_literal: true
2+
3+
# https://leetcode.com/problems/search-in-rotated-sorted-array/
4+
# @param {Integer[]} nums
5+
# @param {Integer} target
6+
# @return {Integer}
7+
def search33(nums, target)
8+
return 0 if nums.first == target
9+
10+
s = 0
11+
e = nums.length - 1
12+
while s <= e
13+
m = (s + e) / 2
14+
f = nums.first
15+
curr = nums[m]
16+
17+
return m if curr == target
18+
19+
if f > curr
20+
if target < f && target > curr
21+
s = m + 1
22+
else
23+
e = m - 1
24+
end
25+
elsif f < target && target < curr
26+
e = m - 1
27+
else
28+
s = m + 1
29+
end
30+
end
31+
32+
-1
33+
end
Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
# frozen_string_literal: true
2+
3+
require_relative '../test_helper'
4+
require_relative '../../lib/medium/33_search_in_rotated_sorted_array'
5+
require 'minitest/autorun'
6+
7+
class SearchInRotatedSortedArrayTest < ::Minitest::Test
8+
def test_default
9+
assert_equal(4, search33([4, 5, 6, 7, 0, 1, 2], 0))
10+
assert_equal(-1, search33([4, 5, 6, 7, 0, 1, 2], 3))
11+
assert_equal(-1, search33([1], 0))
12+
end
13+
end

test/test_helper.rb

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,7 @@
55
::SimpleCov.use_merging(true)
66
::SimpleCov.start do
77
add_filter '706_design_hashmap'
8+
add_filter '33_search_in_rotated_sorted_array'
89

910
minimum_coverage 100
1011
end

0 commit comments

Comments
 (0)