dsbwyx's blog

题目链接： Median of Two Sorted Arrays这道题坑还是有点多的，刚看到的时候第一反应是：这不就是归并排序....还是图样啊。所以先这样提交了：class Solution(object): def findMedianSortedArrays(self, nums1, nums2): """ :type nums1:

Leetcode #39. Combination Sum题目https://leetcode.com/problems/combination-sum/description/代码class Solution {public: void foo(vector<int>& candidates, int target, int cidx, vect...

Leetcode #121. Best Time to Buy and Sell Stock题目https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/代码class Solution {public: int maxProfit(vector<int>& pr...

Leetcode #231. Power of Two题目https://leetcode.com/problems/power-of-two/description/代码我的：class Solution {public: bool isPowerOfTwo(int n) { if (n <= 0) return false; ...

Leetcode #780. Reaching Points题目https://leetcode.com/problems/reaching-points/description/代码一开始的思路是逆向推，目的坐标(tx, ty)肯定是由(tx-ty, ty)或(tx, ty-tx)，但是坐标限定不为负数，因此比较tx、ty的大小可以唯一确定上一步的步骤于是有：cl...

Leetcode #746. Min Cost Climbing Stairs题目https://leetcode.com/problems/min-cost-climbing-stairs/description/代码Simple Question. 没啥好说的，数组那里优化下，用两个变量就可以。class Solution {public: int minCo...

Leetcode #395. Longest Substring with At Least K Repeating Characters题目链接https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/description/代码思路：首先检查当前字符串是否满足...

class Solution: def reverse(self, x): """ :type x: int :rtype: int """ ret = 0 nega = 0 if x > 0 else 1 if nega: x = -x

1. 题目ZigZag字符串的描述见题目链接。给定行号，对于一个ZigZag字符串，需要按行号顺序输出每行的内容。2. 代码# 比较简单，将ZigZag字符串按顺序遍历，每个字符放入对应行中class Solution(object): def convert(self, s, numRows): """ :type s: str :type

Leetcode #516. Longest Palindromic Subsequence题目https://leetcode.com/problems/longest-palindromic-subsequence/description/代码比较典型的动态规划问题。递归写了一遍TLE了，循环方法没有问题。class Solution {public: ...