qq_39575851的博客

class Solution {public: string longestPalindrome(string s) { return manachar(s); } string manachar(string &s) { char b[2002]; int p[2002]; int len ...

/*// Employee infoclass Employee {public: // It's the unique ID of each node. // unique id of this employee int id; // the importance value of this employee int importance; ...

class Solution {public: vector<string> findItinerary(vector<vector<string>>& tickets) { vector<string> res; unordered_map<string, multiset<string...

class Solution {public: int findJudge(int N, vector<vector<int>>& trust) { if(trust.size() == 1) return trust[0][1]; vector<int> dout(N, 0); ...

class Solution {public: vector<string> topKFrequent(vector<string>& words, int k) { map<string, int> mp; for(int i =0; i < words.size(); i++) { ...

class Solution {public: int subarraySum(vector<int>& nums, int k) { if(nums.empty()) return 0; map<int, int> mp; mp[0] = -1; int sum = ...

class Solution {public: int subarraySum(vector<int>& nums, int k) { if(nums.empty()) return 0; map<int, int> mp; mp[0] = -1; int sum = ...

class Solution {public: bool canFinish(int numCourses, vector<vector<int>>& prerequisites) { int length = prerequisites.size(); vector<int> c(length, 0); ...

class Solution {public: int strStr(string haystack, string needle) { if(haystack.size() == needle.size() && haystack == needle) return 0; if(haystack.size() &l...

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* od...