HuiFeiDeTuoNiaoGZ-CSDN博客

An effective system design interview gives strong signals about aperson’s ability to collaborate, to work under pressure, and to resolve ambiguity constructively. The ability to ask good questions is also an essential skill, and many interviewers specific

2023-09-13 11:47:42 151

原创 CHAPTER 2: BACK-OF-THE-ENVELOPE ESTIMATION

interview.

2023-09-07 08:28:57 155

原创 CHAPTER 1: SCALE FROM ZERO TO MILLIONS OF USERS

simplehas limitnodes;server.Decouplingtier, etc.

2023-09-06 11:10:16 133

原创 workday vo Minimum Window Substring

哈希表+遍历子串 On2超时class Solution {public: string minWindow(string s, string t) { unordered_map<char, int> map; for(char c : t){ map[c] ++; } string ans = ""; for(int i = 0; i < s.length(); i++)

2021-12-02 12:51:45 3404

原创 leetcode 937(未完)

class Solution {public: static bool cmp(string a, string b){ int key1 = getkey(a); int key2 = getkey(b); if(a.substr(key1) == b.substr(key2)){ //cout<<a.substr(0,key1) <<' '<< a.substr(0,key2);

2021-11-16 13:29:50 4436

原创 200. Number of Islands(未完)

DFSclass Solution {public: vector<int> dir{-1,0,1,0,-1}; int numIslands(vector<vector<char>>& grid) { vector<vector<int>> visited(grid.size(), vector<int>(grid[0].size(), 0)); int res = 0;

2021-11-09 00:39:26 246

原创 245. Shortest Word Distance III

自己写的，变体双指针，极度麻烦但过了，时间复杂度On 空间复杂度Onclass Solution {public: int Min(int a, int b){ return a < b ? a : b; } int shortestWordDistance(vector<string>& wordsDict, string word1, string word2) { int flag = 0; if(w

2021-11-05 11:26:43 135

原创 207. Course Schedule(未完)

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

2021-10-27 23:25:36 138

原创 310. Minimum Height Trees（未完）

自己做的，超时class Solution {public: vector<int> findMinHeightTrees(int n, vector<vector<int>>& edges) { vector<int> res; unordered_map<int,vector<int>> map; for(int i = 0; i < edges.size()

2021-10-26 09:57:38 127

原创 154. Find Minimum in Rotated Sorted Array II

自己做的，双指针，但是复杂度不太乐观class Solution {public: int findMin(vector<int>& nums) { int i = 0; int j = nums.size() - 1; while(i + 1 < nums.size() && j - 1 >= 0 && i <= j){ if(nums[i+1] &lt

2021-10-23 11:18:04 107

原创每日一题 151. Reverse Words in a String

自己写的class Solution {public: string reverseWords(string s) { vector<string> words; int i = 0; while(s[i] == ' ' && i < s.length()){ i++; } while(i < s.length()){ strin

2021-10-20 11:17:55 114

原创 tiktokOA 1347 Minimum Number of Steps to Make Two Strings Anagram

直接过了，但很慢class Solution {public: int minSteps(string s, string t) { unordered_map<char,int> map; for(int i = 0; i < t.length(); i++){ map[t[i]]++; } for(int i = 0; i < s.length(); i++){

2021-10-04 04:21:07 191

原创 tiktokOA 1048. Longest String Chain

自己写的，超时class Solution {public: int longestStrChain(vector<string>& words) { int maxn = 1; for(int i = 0; i < words.size(); i++){ maxn = max(maxn, dfs(words[i],words)); } return maxn; }

2021-10-03 13:20:30 159

原创 tiktokOA Add Two Numbers

自己做的/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * ListNode(int x) : val(x), next(nullptr) {} * ListNode(int x, ListNode *next) : val(x), next(

2021-10-03 07:31:59 132

原创 tiktokOA fizz buzz

自己做的class Solution {public: vector<string> fizzBuzz(int n) { vector<string> res; for(int i = 1; i <= n; i++){ if(i % 3 == 0){ if(i % 5 == 0){ res.push_back("FizzBuzz");

2021-10-03 06:25:58 529

原创 504 HW4

Zhen GaoS01401440Extensible[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-pWggSOJV-1633068895352)(./uml.jpg)]Use Factory Design Pattern to create Balls and Strategies.Class MovingBall inherited Ball, adding strategy and name properties and fuctions that suppo

2021-10-01 15:11:59 478

空空如也

空空如也