본문 바로가기

분류 전체보기11

Codility[Lesson 6] - Sorting(MaxProdictOfThree) A non-empty array A consisting of N integers is given. The product of triplet (P, Q, R) equates to A[P] * A[Q] * A[R] (0 ≤ P < Q < R < N). For example, array A such that: A[0] = -3 A[1] = 1 A[2] = 2 A[3] = -2 A[4] = 5 A[5] = 6 contains the following example triplets: (0, 1, 2), product is −3 * 1 * 2 = −6(1, 2, 4), product is 1 * 2 * 5 = 10(2, 4, 5), product is 2 * 5 * 6 = 60 Your goal is to find.. 2021. 8. 27.
HTTP Header에는 크기 제한이 있는가? HTTP 통신을 사용하다 보면 헤더에 정보를 담아 보내는 경우가 있다. 여기서 궁금한 점이 생겨 검색해보고 찾은 정보를 공유하려 한다. HTTP 헤더에는 크기제한이 있는가? 답은 상황에따라 다르다. 기본적으로 HTTP RFC에는 헤더의 최대 크기 제한은 없다. 하지만 우리가 사용하는 웹서버 소프트웨어에서 크기를 제한하고 있다. Here is the limit of most popular web server Web Server Defualt Limit Apache 8K Nginx 4K-8K IIS 8K-16K Tomcat 8K – 48K Node (13) - 16K No, HTTP does not define any limit. However most web servers do limit size of h.. 2021. 8. 27.
Codility[Lesson 3] - Time Complexity(TapeEquilibrium) A non-empty array A consisting of N integers is given. Array A represents numbers on a tape. Any integer P, such that 0 < P < N, splits this tape into two non-empty parts: A[0], A[1], ..., A[P − 1] and A[P], A[P + 1], ..., A[N − 1]. The difference between the two parts is the value of: |(A[0] + A[1] + ... + A[P − 1]) − (A[P] + A[P + 1] + ... + A[N − 1])| In other words, it is the absolute differ.. 2021. 8. 26.
Codility[Lesson 3] - Time Complexity(PermMissingElem) An array A consisting of N different integers is given. The array contains integers in the range [1..(N + 1)], which means that exactly one element is missing. Your goal is to find that missing element. Write a function: class Solution { public int solution(int[] A); } that, given an array A, returns the value of the missing element. For example, given array A such that: A[0] = 2 A[1] = 3 A[2] =.. 2021. 8. 26.

티스토리툴바