- 博客(4)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode 564. Find the Closest Palindrome(查找最近的回文数，C++)
题目 Given an integer n, find the closest integer (not including itself), which is a palindrome. The ‘closest’ is defined as absolute difference minimized between two integers. Example 1: Input: "123" O...
2019-09-30 17:55:35
158
原创 LeetCode 149. Max Points on a Line
题目 Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. Example 1: Input: [[1,1],[2,2],[3,3]] Output: 3 Explanation: ^ | | o | o | o +-----...
2019-09-29 16:38:56
78
原创 LeetCode 115. Distinct Subsequences 递归法（回溯法）/动态规划 int-unsigned int
题目 Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequence of a string is a new string which is formed from the original string by deleting some (...
2019-09-05 11:47:18
151
原创 LeetCode784. Letter Case Permutation && 回溯法总结 && 记录调试经验输出中的空格问题
LeetCode784. Letter Case Permutation && 记录调试经验：cout << ' '中使用多个空格输出数值题目说明思路子集树排序树调试记录回溯法参考： 题目说明 Given a string S, we can transform every letter individually to be lowercase or uppercase...
2019-09-01 11:10:42
199
Opencv4.0.0含opencv_contrib(win10+vs2017编译版)
2018-12-06
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人