zwfars的专栏

最近开始学习C++，然后开始算法题了。好像两年没有做过算法题了。。 题目链接  https://leetcode.com/problems/word-pattern/ 我的方法比较笨，首先将str转化为一个单词组，如果pattern 里面哪两个字符相等，那么单词组的单词也要相等。。 讨论区里大家的算法比较好，是纵向比较。就是一个映射。比如我pattern 里面的a对应的是str的dog

class Solution { public: static bool cmp(const string& s1, const string& s2) { if (s1.size() == s2.size()) return s1 < s2; return s1.size()>s2.size(); } string findLongestWord(string s, vec

class Solution { public: bool checkSubarraySum(vector& nums, int k) { int len = nums.size(); vector sum(len+5); for(int i= 1;i<=len;i++) sum[i] = sum[i-1] + num

class Solution { public: int getMinimumDifference(TreeNode* root) { vector tem; dfs(root,tem); int ans; int len = tem.size(); ans = abs(tem[1]-tem[0]);

class Solution { public: int findRotateSteps(string ring, string key) { int lenring = ring.size(); int lenkey = key.size(); vector> dp(200, vector(200, 1000000)); for (int i = 0; i < lenkey;

class Solution { public: vector> levelOrderBottom(TreeNode* root) { vector> ans; if(!root) return ans; queue aux; aux.push(root); while(!aux.emp

class Solution { public: int findMaxLength(vector& nums) { int len = nums.size(); unordered_map aux; aux[0] = -1; int cnt = 0; int ans = 0; for(int

class Solution { public: int countArrangement(int N) { vector test(N+5,0); for (int i = 1; i <= N; i++) test[i] = i; int ans = 0; vector> ansvec; vector> avec; create(test, 1, N, ans);

class MyQueue { public: /** Initialize your data structure here. */ stack pstack; stack auxstack; MyQueue() { } /** Push element x to the back of queue. */ void push(i

class Solution { public: int maxProfit(vector& prices) { int len = prices.size(); if(!len) return 0; vector dp(len+5); for(int i=1;i<len;i++)

class Solution { public: vector> updateBoard(vector>& board, vector& click) { int x = click[0]; int y = click[1]; int high = board.size(); int len = board[0].size(); vector> ans(board); i