반응형

leetcode 5

[LeetCode] Squares of a Sorted Array

https://leetcode.com/explore/learn/card/fun-with-arrays/521/introduction/3240/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com 문제 정수 배열에 있는값들을 제곱근하고 정렬 후 출력하세요 풀이 class Solution { public int[] sortedSquares(int[] nums) ..

알고리즘 2021.09.15

[Leetcode] Find Numbers with Even Number of Digits

https://leetcode.com/explore/learn/card/fun-with-arrays/521/introduction/3237/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com 문제 정수로 되어있는 배열이 주어진다. 배열 길이에 짝수가 몇개인지 알아보는 문제이다 풀이 class Solution { public int findNumbers(i..

알고리즘 2021.09.12

[Leetcode]Max Consecutive Ones

https://leetcode.com/explore/learn/card/fun-with-arrays/521/introduction/3238/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com Success 이진 배열 숫자가 주어지면 배열에서 연속된 최대 1을 반환한다. 풀이 nums[i] 에는 0과 1로 이루어져있다. [1,0,0,1,1,0,1] 이 있다..

알고리즘 2021.09.09

[LeetCode] Squares of a Sorted

https://leetcode.com/explore/learn/card/fun-with-arrays/523/conclusion/3574/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com Success 내림차수가 아닌 순서로 정렬된 정수배열을 각 숫자의 제곱 배열을 내림차수가 아닌순서로 정렬 하는 문제이다 풀이 s라는 배열에 nums 배열의 길이만큼 받는..

카테고리 없음 2021.09.07

[LeetCode]Find All Numbers Disappeared in an Array

https://leetcode.com/explore/learn/card/fun-with-arrays/523/conclusion/3270/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com Success 배열을 정렬하고 [1,n] 사이에 없는 숫자를 찾아 넣어야한다. 풀이 먼저 nums의 배열을 정렬한 후 nums의 길이을 i만큼 돌리는데 binarySea..

알고리즘 2021.09.06
반응형