2019年2月12日
19.2.12 [LeetCode 70] Climbing Stairs
摘要： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文
posted @ 2019-02-12 22:11 TobicYAL 阅读(146) 评论(0) 推荐(0)
19.2.12 [LeetCode 69] Sqrt(x)
摘要： Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the return type is an in 阅读全文
posted @ 2019-02-12 22:04 TobicYAL 阅读(301) 评论(0) 推荐(0)
19.2.12 [LeetCode 68] Text Justification
摘要： Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justif 阅读全文
posted @ 2019-02-12 21:46 TobicYAL 阅读(166) 评论(0) 推荐(0)
19.2.12 [LeetCode 67] Add Binary
摘要： Given two binary strings, return their sum (also a binary string). The input strings are both non-empty and contains only characters 1 or 0. Example 1 阅读全文
posted @ 2019-02-12 20:02 TobicYAL 阅读(148) 评论(0) 推荐(0)
19.2.12 [LeetCode 66] Plus One
摘要： Given a non-empty array of digits representing a non-negative integer, plus one to the integer. The digits are stored such that the most significant d 阅读全文
posted @ 2019-02-12 17:39 TobicYAL 阅读(170) 评论(0) 推荐(0)