뽀블로그

1. View [팝업열기버튼] [일반 레이어팝업] [모달레이어 팝업] 2. Implementation contents 1) [html] CATEGORIES 는 제목, [css] float: center으로 가운데 정렬 2) [html] 각 메뉴들 는 내용, [css] margin을 이용하여 위아래 간격을 줌 3) '뽀블로그 클릭'을 누르면 새 창에서 블로그로 이동 - 이용 _black를 쓰면 새 창에서 열림 4) 닫기창 누르면 레이어창이 보이지 않음 - [html] 이미지를 이용해 닫기버튼 삽입 - [css] cursor: pointer; 로 닫기 창에 마우스를 가져가면 화면에 그려지는 마우스포인터가 아래 사진으로 바뀜 - [js/jquery] $("#close_button").click(fun..

1. Problem 각 세션의 시작시간은 StartTime 함수에 들어있고 각 시작시간의 발표시간은 RunningTime에 들어있다. 시간당 한 세션밖에 발표할 수 없다. 주어진 start_time과 running_time에서 발표가능한 최대 세션 횟수를 구하여라. case1) Input : n = 5; start_time : [1,3,3,5,7], running_time: [2,2,1,2,1] Output : 3 case2) Input : n = 3; start_time : [1, 3, 5], running_time: [2 ,2, 2] Output : 3 case3) Input: n = 1; start_time : [1], running_time: [1] Output: 1 주어진 발표리스트에서 가능한 ..

leetcode.com/problems/same-tree/ Same Tree - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 1. Problem Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, a..

leetcode.com/problems/add-binary/submissions/ Add Binary - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 1. Problem Given two binary strings a and b, return their sum as a binary string. Example 1: Input: a = "11", b = "1" Output: "100" Example 2: Input: a = "1010", b = "1011" Ou..

leetcode.com/problems/insert-interval/ Insert Interval - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 1. Problem Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted accor..

leetcode.com/problems/maximum-subarray/ Maximum Subarray - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 1. Problem Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example 1: Input: nums = [-..

leetcode.com/problems/plus-one/ Plus One - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 1. Problem Given a non-empty array of decimal digits representing a non-negative integer, increment one to the integer. The digits are stored such that the most significant digit is at the he..

1. web.xml 에서 DispatcherServlet 선언이 제대로 되어있는지 확인 appServlet /* url-pattern 항목에 / 로 되어있는지 확인 → /* 변경 2. servlet-context.xml 에 설정 확인 component:scan 확인 3. url mapping이 잘 되어있는지 컨트롤러에서 확인 4. servlet-context.xml에 선언 확인 5. 오타 확인 @RequestMapping( value , method ) 오타가 있는지 없는지 확인하기 6. 서버 클린, 프로젝트 클린 후 서버 재시작 필자경우 6번으로 해결..

leetcode.com/problems/length-of-last-word/ Length of Last Word - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 1. Problem Given a string s consists of some words separated by spaces, return the length of the last word in the string. If the last word does not exist, return 0. A wo..