IT討論區(85) 夏天一到,IT狗部就會特別酸臭,生人勿近

手一黏便緊(UTC+9 2020-6-4 21:35:52 Btw我online test好似滿分

:^(

實驗羊 2020-6-4 21:42:34 屌

手一黏便緊(UTC+9 2020-6-4 21:42:53 Btw (length_of_longest_consecutive_subsequence(counting_sort(H))+1)*...(V)

實驗羊 2020-6-4 21:47:37 諗唔到呢啲解法我做最Dummy都做唔切

:^(

手一黏便緊(UTC+9 2020-6-4 21:48:06 最dummy即係點

實驗羊 2020-6-4 21:57:23 H: [1]
V: [1]

[1, 1, 1]
[1, 1, 1]
[1, 1, 1]

...

[2, 1]
[2, 1]
[2, 1]

...

[]
[4, 2]
[2, 1]

Ans = 4

IT狗呃飯食 2020-6-4 21:58:28 做左一邊再increment落去？
9up

:^(

素晴 2020-6-4 22:08:26 搵max area

:^(

唔係好明

實驗羊 2020-6-4 22:12:03 最大冇分隔嘅面積

素晴 2020-6-4 22:14:05 max H interval * max V interval

:^(

如果冇理解錯
H [0, 1, 3]
V [0, 1, 3]
2*2 = 4

有錯請屌

:^(

實驗羊 2020-6-4 22:17:22 唔係

H 同 V 係抽走啲 Axis 編號

eg H = [1, 4, 6]

抽走橫 axis 第 1 4 6 條線再計下個 grid 邊個格變到最大

實驗羊 2020-6-4 22:20:40 不如你呢個解法應該都啱

素晴 2020-6-4 22:22:28 撞咗notation

:^(

即係一開始齊晒axis
H_0 = [0, 1, 2, 3]
H = [1] 嘅話
H_f = H_0.filter(h => !H.includes(h)) = [0, 2, 3] max interval係 2-0=2

同理V = [0, 2, 3], max interval係 2

實驗羊 2020-6-4 22:25:08 啱不過我做嗰陣乜都諗唔到淨係諗緊 Brute Force

對上一次做 Test 喺度諗諗咗勁耐最後發現自己係錯

:^(

嘥咗一半時間最後 Brute Force 咗佢算

素晴 2020-6-4 22:28:05 佢考閱讀理解同implementation多?

:^(

考algo嗰啲多數brute force會TLE

:^(

實驗羊 2020-6-4 22:29:28 佢呢啲最門檻嘅應該純粹睇你係咪傻仔而我好明顯係

:^(

素晴 2020-6-4 22:31:48 通常呢啲問題啲description會懶係有情景會整到水蛇春咁長

:^(

咩農夫有塊田之後要中間整幾多條路咁上下

:^(

睇都唔想睇
不過我唔知實際係點啦

實驗羊 2020-6-4 22:44:53 中曬

:^(

佢話咩當個 Grid 係囚犯個鐵閘
之後有幾條 Bar 唔見咗
搵最大嗰個窿捐

:^(

長崎失眠 2020-6-4 22:52:34 比啲廢話fake 咗咁都幾唔抵

:^(

實驗羊 2020-6-4 22:59:24 自己柒啫冇咩唔抵我係唔太適合做呢啲題特別係限時

:^(

手一黏便緊(UTC+9 2020-6-4 23:47:01 試下做多啲HKOI junior卷

實驗羊 2020-6-4 23:58:34 算啦我呢啲呃飯食為主

reactive 2020-6-5 00:34:15 禁似上個星期leetcode contest problem黎

:^(

有馬拓也 2020-6-5 02:09:53

:^(