728x90
๋ฐ์ํ
581. Shortest Unsorted Continuous Subarray
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an integer array nums, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order. Return the shortest such subarray and output its length. Example 1: Input: nums = [2,6,4,8,10,9,15] Output: 5 Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to ..
Algorithm/LeetCode Daily Challenge
2022. 5. 13. 10:30
728x90
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 83,835
- Today
- 55
- Yesterday
- 439
๋งํฌ
TAG
- @ManyToOne
- Spring Boot Tutorial
- leetcode
- leetcode bst
- spring boot application
- Spring Data JPA
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- spring boot app
- Spring Boot JPA
- ์คํ๋ง ๋ถํธ
- ์คํ๋ง ๋ถํธ jwt
- leetcode stack
- JPA
- ์๊ณ ๋ฆฌ์ฆ
- spring boot jwt
- QueryDSL
- Jackson
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- intellij
- Java
- r
- gRPC
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ์คํ๋ง๋ถํธ
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- proto3
- JSON
- leetcode binary search
- Linux
- Spring Boot