문제 https://leetcode.com/problems/single-number/ Given a non-empty array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?Example 1:Input: [2,2,1] Output: 1 Example 2:Input: [4,1,2,1,2] Output: 4----------------------------------------------------------------..
문제 https://leetcode.com/problems/jewels-and-stones/ You're given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the stones you have are also jewels.The letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, so "a"..
- Total
- Today
- Yesterday
- 문자열
- 실수
- quicksort
- 정렬
- 길이
- 시간복잡도
- 국영수
- BOJ
- sort
- 알고리즘
- Arrays
- 코딩
- 자바
- length
- 10825
- tim sort
- java
- 개발
- str.length()
- collections
- C++
- String
- 용량
- Arrays.sort
- MergeSort
- Comparator
- Collections.sort
- leetcode
- 플로이드
- strlen
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |