Hello, everyone preparing for coding tests! Today, we will conduct the second lecture on ‘Finding Minimum Value’. In this lecture, we will address an algorithm problem that requires finding the minimum value in a given array that satisfies a specific condition. I will explain the process of solving this algorithm problem step by step, so please read carefully.<\/p>\n
Given an integer array To solve this problem, you need to follow these steps:<\/p>\n The time complexity to solve the above problem is O(n) because the array is traversed only once. The space complexity is O(1) as no additional space is required.<\/p>\n Now, let’s write Python code based on the above algorithm.<\/p>\n After writing the code, you should check if it works correctly with a few test cases.<\/p>\n In this lecture, we solved the problem of finding the minimum value in an array that satisfies a specific condition. Through the implementation of the algorithm and performance analysis, we learned how to clearly understand and solve the problem. I hope you continue to challenge various algorithm problems to build your skills. We will return with another topic next time. Thank you!<\/p>\n","protected":false},"excerpt":{"rendered":"nums<\/code> and an integer target<\/code>, write a function that returns the minimum value among numbers in the array that are less than target<\/code>. If no such number exists, it should return -1.<\/p>\nExample Input and Output<\/h3>\n
\n
nums = [1, 3, 5, 7, 9]<\/code>, target = 6<\/code><\/li>\n5<\/code><\/li>\nnums = [1, 2, 3]<\/code>, target = 1<\/code><\/li>\n-1<\/code><\/li>\n<\/ul>\nApproach to the Problem<\/h2>\n
\n
target<\/code>.<\/li>\nAlgorithm Analysis<\/h2>\n
Code Implementation<\/h2>\n
def find_min_less_than_target(nums, target):\n min_value = float('inf') # Initialize to infinity\n found = False # Variable to check if a number satisfying the condition has been found\n\n for num in nums:\n if num < target:\n found = True # Found a number less than target\n min_value = min(min_value, num) # Update minimum value\n\n return min_value if found else -1 # Return value based on condition satisfaction<\/code><\/pre>\nTest Cases<\/h2>\n
assert find_min_less_than_target([1, 3, 5, 7, 9], 6) == 5\nassert find_min_less_than_target([1, 2, 3], 1) == -1\nassert find_min_less_than_target([10, 15, 20, 25, 30], 20) == 15\nassert find_min_less_than_target([1, 2, 3, 0, -1], 2) == 1\nassert find_min_less_than_target([], 5) == -1<\/code><\/pre>\nConclusion<\/h2>\n