반응형 Algorithm/LeetCode10 [LeetCode] 3. Longest Substring Without Repeating Characters 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", with the length of 3. Notice that the ans.. 2022. 4. 18. [LeetCode] 58. Length of Last Word 58. Length of Last Word Given a string s consisting of some words separated by some number of spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only. Example 1: Input: s = "Hello World" Output: 5 Explanation: The last word is "World" with length 5. Example 2: Input: s = " fly me to the moon " Output: 4 Explanation: The last.. 2022. 4. 17. [LeetCode] 9. Palindrome Number 📖문제. 숫자가 입력되면 해당 숫자가 팰린드롬이면 true, 아니면 false 를 출력하세요. Given an integer x, return true if x is palindrome integer. An integer is a palindrome when it reads the same backward as forward. For example, 121 is a palindrome while 123 is not. Example 1: Input: x = 121 Output: true Explanation: 121 reads as 121 from left to right and from right to left. Example 2: Input: x = -121 Output: false Explanatio.. 2022. 4. 17. [LeetCode] 릿코드 시작하기, Github에 자동 커밋(LeetHub) 방법 https://leetcode.com/ LeetCode - The World's Leading Online Programming Learning Platform 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 LeetCode는 전세계적으로 유명한 Online Judge Platform 입니다. 프로그래머스에서도 이곳 문제를 변형해서 출제되는 문제가 많았습니다. 구글/깃허브/페이스북 계정으로 간편하게 가입후 사용 하실수있습니다. ✨LeetHub : Github 에 자동으로 Comm.. 2022. 4. 16. 이전 1 2 다음 300x250
