1. Balanced Binary Tree :::success Recursive Time: $O(N)$：若都是 valid，每個節點都要走過 Space: $O(logN)$：同一時間 stack 最多就是一條 path 從 root 到 leaf。 Runtime 11 ms Beats 81.53%

Apr 7, 2023

1. Two Sum Harry: class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int, int> seen; for(int i = 0; i< nums.size(); i++) { int dif = target - nums[i]; if(seen.count(dif)) {

Apr 7, 2023

Sign in

Password

Forgot password

By clicking below, you agree to our terms of service.

Wallet ( )

Connect another wallet

New to HackMD? Sign up

tags: grind75

Grind 75 Plan

一天兩題

討論

Read more

機車領車注意

Grind 75 Week 3

Grind 75 Week2

Grind 75 Week1

tags: `grind75`