Description The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I I G Y I R And then read line by line: "PAHNAPLSIIGYIR" Write the code that will take a string and make this conversion given a number of rows: string convert(string s, int numRows); 주어진 숫자의 행으로 이..

Description Given a string s, return the longest palindromic substring in s. string s에서 가장 긴 거꾸로 읽어도 같은 substring을 구하라. Example 1: Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer. Example 2: Input: s = "cbbd" Output: "bb" Constraints: 1

Solution class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { int index1 = 0, index2 = 0; int answer1 = 0, answer2 = 0; for(int i=0;i

Description Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 주어진 두 개의 배열의 중앙값(크기 순서에서 가장 가운데의 값)을 구하라 Example 1: Input: nums1 = [1,3], nums2 = [2] Output: 2.00000 Explanation: merged array = [1,2,3] and median is 2. Example 2: Input: nums1 = [1,2], nums2 = [3,4] Output: 2.5000..

Description Given a string s, find the length of the longest substring without repeating characters. 반복되는 문자가 없는 가장 긴 문자열의 길이를 구하라. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: Input: s = "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1. Example 3: Input: s = "pwwkew" Output: 3 Explanation: The answer is "wke"..

Description You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself. 음수가 아닌 한 자리 정수로 구성된 리스트가 두 개 주어진다. 리스트가 나타내는 는 거꾸로 들어있다. 두 수를 더해라. ..