Algorithms(알고리즘)
1.[LeetCode] 0001. two-sum
Given an array of integersnumsand an integertarget, return_indices of the two numbers such that they add up totarget. You may assume that each input
2.[LeetCode] 0002. Add Two Numbers
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 conta
3.[LeetCode] 0009. Palindrome Number
Given an integer x, return true if x is a palindrome\_\_, and false otherwise.x = 121true121 reads as 121 from left to right and from right to left.x
4.[LeetCode] 0013. Roman to Integer
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.For example, 2 is written as II in Roman numeral, just two ones adde
5.[LeetCode] 0014. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.If there is no common prefix, return an empty string "".strs = "
6.[LeetCode] 0020. Valid Parentheses
Given a string s containing just the characters '(', ')', '{', '}', '\[' and ']', determine if the input string is valid.An input string is valid if:O
7.백준을 시작하기 위한 입출력의 이해
예전에 사놓았던 알고리즘 책을 공부하며 예제 및 문제로 나오는 백준 문제를 접해보았습니다.필자는 알고리즘 사이트 중 프로그래머스를 이용하는데 백준은 너무 어색하네요.(사실 예전에 몇문제 풀고 어색해 프로그래머스로 넘어감...)입출력도 맞춰야 하고... 그래도 사놓은 책