摘要: https://leetcode.com/problems/divide-two-integers/ Given two integers dividend and divisor, divide two integers without using multiplication, division 阅读全文
posted @ 2018-11-19 23:18 丧心病狂工科女 阅读(96) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/ Say you have an array for which the ith element is the price of a given stock on day 阅读全文
posted @ 2018-11-19 20:20 丧心病狂工科女 阅读(89) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ Say you have an array for which the ith element is the price of a given stock on day i. 阅读全文
posted @ 2018-11-19 18:02 丧心病狂工科女 阅读(127) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/rotate-image/ You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note: 阅读全文
posted @ 2018-11-19 16:58 丧心病狂工科女 阅读(130) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/longest-palindromic-substring/ Given a string s, find the longest palindromic substring in s. You may assume that the ma 阅读全文
posted @ 2018-11-19 14:50 丧心病狂工科女 阅读(123) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/sqrtx/ Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative in 阅读全文
posted @ 2018-11-19 14:22 丧心病狂工科女 阅读(137) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/climbing-stairs/ You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 o 阅读全文
posted @ 2018-11-19 09:34 丧心病狂工科女 阅读(154) 评论(0) 推荐(0) 编辑