[LeetCode/릿코드] 35. Search Insert Position 문제 풀이 1 2 3 4 5 6 7 8 9 10 11 12 class Solution { public int searchInsert(int[] nums, int target) { for(int i=0; i target){ return i; } } return nums.length; } } Colored by Color Scripter cs [JAVA] LeetCode/Easy 2023. 1. 13. 16:19
