brobro332.dev

문제Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well. You must not use any built-in exponent function or operator. For example, do not use pow(x, 0.5) in c++ or x ** 0.5 in python.예제 1 Input: x = 4Output: 2// Explanation: The square root of 4 is 2, so we return 2. 예제 2Input: x = 8Output: 2// Explana..

문제Given two binary strings a and b, return their sum as a binary string.예제 1Input: a = "11", b = "1"Output: "100"예제 2Input: a = "1010", b = "1011"Output: "10101"제약조건✅ 1 ✅ a and b consist only of '0' or '1' characters. ✅ Each string does not contain leading zeros except for the zero itself. 문제풀이 1import java.math.BigInteger;class Solution {    public String addBinary(String a, String b) {        ..

문제You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's.Increment the large integer by one and return the resulting array of digits.예제 1Input: digits = [1,2,3]Output: [1,2,4]// Explanatio..

문제Given a string s consisting of words and spaces, return the length of the last word in the string.A word is a maximal substring consisting of non-space characters only.예제 1Input: s = "Hello World"Output: 5Explanation: The last word is "World" with length 5.예제 2Input: s = " fly me to the moon "Output: 4Explanation: The last word is "moon" with length 4.예제 3Input: s = "luffy is still joyb..

문제Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You must write an algorithm with O(log n) runtime complexity.예제1Input: nums = [1,3,5,6], target = 5Output: 2예제2Input: nums = [1,3,5,6], target = 2Output: 1예제3Input: nums = [1,3,5,6], target = 7Output: 4제약조건✅ 1 ✅ -104 ✅ ..

문제Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.예제 1Input: haystack = "sadbutsad", needle = "sad"Output: 0// Explanation: "sad" occurs at index 0 and 6.// The first occurrence is at index 0, so we return 0.예제 2 Input: haystack = "leetcode", needle = "leeto"Output: -1// Explanation: "leeto" did not oc..

문제 Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val. Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things: Change the array nums such that the first k elements of num..

문제Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Then return the number of unique elements in nums. Consider the number of unique elements of nums to be k, to get accepted, you need to do the following things: Change the array nums such that the..

문제You are given the heads of two sorted linked lists list1 and list2.Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists.Return the head of the merged linked list.예제 1Input: list1 = [1,2,4], list2 = [1,3,4]Output: [1,1,2,3,4,4]예제 2Input: list1 = [], list2 = []Output: []예제 3Input: list1 = [], list2 = [0]Output: [0]제약조건✅ The numbe..

문제Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if:1. Open brackets must be closed by the same type of brackets.2. Open brackets must be closed in the correct order. 3. Every close bracket has a corresponding open bracket of the same type.예제 1Input: s = "()"Output: true 예제 2Input: s = "()[]{}"Outpu..