월간 보관물: 2020 8월
[LeetCode] 8 – String to Integer (atoi)
problem : https://leetcode.com/problems/string-to-integer-atoi/ Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this character, takes an optional initial plus or minus sign followed … 계속 읽기
[LeetCode] 312 – Burst Balloons
problem : https://leetcode.com/problems/burst-balloons/ Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[left] * nums[i] * nums[right] coins. Here left and right are adjacent indices … 계속 읽기
[LeetCode] 6 – ZigZag Conversion
problem : https://leetcode.com/problems/zigzag-conversion/ 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 … 계속 읽기
[LeetCode] 85 – Maximal Rectangle
hint 1 : hint 2 : (right – left) * height problem : https://leetcode.com/problems/maximal-rectangle/ Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area. Example: Input: [ [“1″,”0″,”1″,”0″,”0”], [“1″,”0″,”1″,”1″,”1”], … 계속 읽기
Developer Lee 