Nahyun Park

Hi there, I’m Nahyun Park

Recent posts

  1. Search Insert Position

less than 1 minute read

class Solution { public int searchInsert(int[] nums, int target) { for (int i = 0; i < nums.length; i++) { if (nums[i] >= target) ...