[LeetCode] - Biweekly Contest 79
Q&A
Q：Leetcode咩黎咖？食得咖？
A：google啦屌你老母
Q：玩黎有咩用咖？食得咖？
A：google啦屌你老母
連登第一個leetcode contest討論區
柏克萊特母
69 回覆
2 Like
33 Dislike
今晚香港時間22:30~00:00
[LeetCode] - Biweekly Contest 79
Q&A
Q：Leetcode咩黎咖？食得咖？
A：google啦屌你老母
Q：玩黎有咩用咖？食得咖？
A：google啦屌你老母
[LeetCode] - Biweekly Contest 79
Q&A
Q：Leetcode咩黎咖？食得咖？
A：google啦屌你老母
Q：玩黎有咩用咖？食得咖？
A：google啦屌你老母
#3
支持一齊打，入tg group我地個個禮拜10幾條友打，不過入面啲人好勁
冇興趣
唔好借啲意推post
有d人一個半鐘2-3條，有d人，例如裂曲sir半個鐘3-4條
仲有5分鐘
條撚準備
有裂巴推po
有裂巴推po
輕鬆秒殺Q1
入Q2
入Q2
Q2煩膠到
依家先做完
依家先做完
Q3棄權
巴打可唔可以貼d 題目睇下
仆街，q4又segment tree，今日學segment tree先，做唔到
6083. Check if Number Has Equal Digit Count and Digit Value
You are given a 0-indexed string num of length n consisting of digits.
Return true if for every index i in the range 0 <= i < n, the digit i occurs num[i] times in num, otherwise return false.
Example 1:
Input: num = "1210"
Output: true
Explanation:
num[0] = '1'. The digit 0 occurs once in num.
num[1] = '2'. The digit 1 occurs twice in num.
num[2] = '1'. The digit 2 occurs once in num.
num[3] = '0'. The digit 3 occurs zero times in num.
The condition holds true for every index in "1210", so return true.
You are given a 0-indexed string num of length n consisting of digits.
Return true if for every index i in the range 0 <= i < n, the digit i occurs num[i] times in num, otherwise return false.
Example 1:
Input: num = "1210"
Output: true
Explanation:
num[0] = '1'. The digit 0 occurs once in num.
num[1] = '2'. The digit 1 occurs twice in num.
num[2] = '1'. The digit 2 occurs once in num.
num[3] = '0'. The digit 3 occurs zero times in num.
The condition holds true for every index in "1210", so return true.
呢個好似counter forloop 就做完 有無下題
巴打做成點
Q4完到？
Q4完到？
唔識segment tree，知道方向，一條max tree一條sum tree，唔識寫，放棄lol，今日學返segment tree
唔想學新野了，做下contest希望唔生梳就算
q3原來勁易
痾個屎10分鐘唔洗都寫完
q3原來勁易
痾個屎10分鐘唔洗都寫完