2019年4月1日
Lintcode449-Char to Integer-Naive
摘要： Description Convert a char to an integer. You can assume the char is in ASCII code (See Definition, so the value of the char should be in 0~255. Examp 阅读全文
posted @ 2019-04-01 11:55 IreneZh 阅读(205) 评论(0) 推荐(0) 编辑
Leetcode1 - A + B Problem - Easy
摘要： Write a function that add two numbers A and B. Example Example 1: Input: a = 1, b = 2 Output: 3 Explanation: return the result of a + b. Example 2: In 阅读全文
posted @ 2019-04-01 11:00 IreneZh 阅读(293) 评论(0) 推荐(0) 编辑
2019年3月31日
Lintcode9-Fizz Buzz-Easy
摘要： Fizz Buzz Given number n. Print number from 1 to n. But: when number is divided by 3, print "fizz". when number is divided by 5, print "buzz". when nu 阅读全文
posted @ 2019-03-31 18:13 IreneZh 阅读(134) 评论(0) 推荐(0) 编辑
Lintcode27-Reverse 3-digit Integer
摘要： Reverse a 3-digit integer. Reverse a 3-digit integer. Example Example 1: Input: number = 123 Output: 321 Example 2: Input: number = 900 Output: 9 Exam 阅读全文
posted @ 2019-03-31 17:17 IreneZh 阅读(182) 评论(0) 推荐(0) 编辑
2019年3月30日
Leetcode167-Two Sum II Input array is sorted-Easy
摘要： Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function 阅读全文
posted @ 2019-03-30 17:02 IreneZh 阅读(126) 评论(0) 推荐(0) 编辑
Leetcode122-Best Time to Buy and Sell Stock II-Easy
摘要： Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文
posted @ 2019-03-30 16:33 IreneZh 阅读(110) 评论(0) 推荐(0) 编辑
Leetcode121-Best Time to Buy and Sell Stock I - Easy
摘要： I Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transacti 阅读全文
posted @ 2019-03-30 14:47 IreneZh 阅读(114) 评论(0) 推荐(0) 编辑
Leetcode118_Pascal's Triangle_Easy
摘要： Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers 阅读全文
posted @ 2019-03-30 13:57 IreneZh 阅读(103) 评论(0) 推荐(0) 编辑
Leetcode88_Merge Sorted Array_Easy
摘要： Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: The number of elements initialized in nums1 and num 阅读全文
posted @ 2019-03-30 12:11 IreneZh 阅读(66) 评论(0) 推荐(0) 编辑
2019年3月28日
Leetcode66-Plus One-Eassy
摘要： 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-03-28 13:26 IreneZh 阅读(105) 评论(0) 推荐(0) 编辑