일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 안드로이드스튜디오
- 코딜리티
- IntentTestRule
- 안드로이드13
- high order function
- Fragment에서 Activity의 함수 사용하기
- LayoutManger
- searchview
- 구분선
- 고차함수
- Fragment 수동 추가
- fragment
- 안드로이드
- 안드로이드개발레벨업교과서
- 리사이클러뷰
- 스와이프
- 뷰변경 감지
- Android
- 생명주기
- espresso
- adapter
- 코틀린
- ui test
- viewholder
- Error:Execution failed for task ':app:mergeDebugResources'
- 테마 아이콘
- recyclerview
- ActivityTestRule
- 재사용
- binding adapter
- Today
- Total
목록개발/알고리즘 (34)
룬아님의 취중코딩
Brackets A string S consisting of N characters is considered to be properly nested if any of the following conditions is true: S is empty; S has the form "(U)" or "[U]" or "{U}" where U is a properly nested string; S has the form "VW" where V and W are properly nested strings. For example, the string "{[()()]}" is properly nested but "([)()]" is not. Write a function: class Solution { public int..
NumberOfDiscIntersections We draw N discs on a plane. The discs are numbered from 0 to N − 1. An array A of N non-negative integers, specifying the radiuses of the discs, is given. The J-th disc is drawn with its center at (J, 0) and radius A[J]. We say that the J-th disc and K-th disc intersect if J ≠ K and the J-th and K-th discs have at least one common point (assuming that the discs contain ..
Triangle An array A consisting of N integers is given. A triplet (P, Q, R) is triangular if 0 ≤ P A[R], A[Q] + A[R] > A[P], A[R] + A[P] > A[Q]. For example, consider array A such that: A[0] = 10 A[1] = 2 A[2] = 5 A[3] = 1 A[4] = 8 A[5] = 20 Triplet (0, 2, 4) is triangular. Write a function: class Solution { public int solution(int[] A); } that, given an array A con..
MinAvgTwoSlice A non-empty array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P < Q < N, is called a slice of array A (notice that the slice contains at least two elements). The average of a slice (P, Q) is the sum of A[P] + A[P + 1] + ... + A[Q] divided by the length of the slice. To be precise, the average equals (A[P] + A[P + 1] + ... + A[Q]) / (Q − P + 1). Fo..