卖程序的小歪

摘要： 好久没写动态规划，中午听到学长们讨论的一道题，就是给出一组硬币面额，和一个目标数值，求有几种找零方式（想半天没想清楚）#include #include using namespace std;int count(int* s, int m, int n) { if (n == 0) retu... 阅读全文

摘要： class Solution{ public: int maxArea(vector& height) { int len = height.size(), low = 0, high = len -1 ; int maxArea = 0; ... 阅读全文

摘要： class Solution {private: vector result;public: vector wordBreak(string s, unordered_set &dict) { vector > dp; result.clear(); ... 阅读全文

摘要： class Solution {private: int* memo;public: bool wordBreak(string s, unordered_set &dict) { memo = new int[s.length() + 1]; for (in... 阅读全文

摘要： int sunday(string str, string pattern) { int str_len = str.length(); int pat_len = pattern.length(); int char_pos[256]; for (int i = 0... 阅读全文

摘要： ```cppclass Solution {public: void connect(TreeLinkNode *root) { if (root == NULL) return; queue que; que.push(root); i... 阅读全文

摘要： Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-nega... 阅读全文

摘要： class Solution {private: vector > nodes;public: vector > levelOrderBottom(TreeNode *root) { nodes.clear(); dfs(root, 0); re... 阅读全文

摘要： class Solution {private: vector > nodes;public: vector > levelOrder(TreeNode *root) { nodes.clear(); dfs(root, 0); return n... 阅读全文

摘要： class Solution {public: int search(int A[], int n, int target) { if (n last) { left = mid; } else { ... 阅读全文