【新手向】i++ vs ++i 你是哪一派?它们又有什么区别?
Hua Hua
【新手向】i++ vs ++i 你是哪一派?它们又有什么区别?
8:40
emplace_back更好?能完美替代push_back吗?
Hua Hua
emplace_back更好?能完美替代push_back吗?
9:47
C++/STL中[]操作符和at()函数的区别
Hua Hua
C++/STL中[]操作符和at()函数的区别
13:01
[CC] Only one difference? C++ Struct vs Class
Hua Hua
[CC] Only one difference? C++ Struct vs Class
5:36
实测36TOPs!骁龙8 Gen 2 AI性能分析
Hua Hua
实测36TOPs!骁龙8 Gen 2 AI性能分析
11:16
当中老年程序员第一次使用Github Copilot...
Hua Hua
当中老年程序员第一次使用Github Copilot...
7:39
花花酱 LeetCode 2662. Minimum Cost of a Path With Special Roads - 刷题找工作 EP411
Hua Hua
花花酱 LeetCode 2662. Minimum Cost of a Path With Special Roads - 刷题找工作 EP411
16:47
花花酱 LeetCode 2564. Substring XOR Queries - 刷题找工作 EP410
Hua Hua
花花酱 LeetCode 2564. Substring XOR Queries - 刷题找工作 EP410
11:14
花花酱 LeetCode 2560. House Robber IV - 刷题找工作 EP409
Hua Hua
花花酱 LeetCode 2560. House Robber IV - 刷题找工作 EP409
15:02
花花酱 LeetCode 1061. Lexicographically Smallest Equivalent String - 刷题找工作 EP408
Hua Hua
花花酱 LeetCode 1061. Lexicographically Smallest Equivalent String - 刷题找工作 EP408
9:57
花花酱 LeetCode 2523. Closest Prime Numbers in Range - 刷题找工作 EP407
Hua Hua
花花酱 LeetCode 2523. Closest Prime Numbers in Range - 刷题找工作 EP407
8:32
[7 Methods] LeetCode 287 Find the Duplicate Number - 花花酱 刷题找工作 EP406
Hua Hua
[7 Methods] LeetCode 287 Find the Duplicate Number - 花花酱 刷题找工作 EP406
18:17
🧬 ▶️ 不同程序员如何编译运行TA们的代码 | 小白  vs 硬核  vs 大厂 vs 2B
Hua Hua
🧬 ▶️ 不同程序员如何编译运行TA们的代码 | 小白 vs 硬核 vs 大厂 vs 2B
1:27
花花酱 LeetCode 2476. Closest Nodes Queries in a Binary Search Tree - 刷题找工作 EP405
Hua Hua
花花酱 LeetCode 2476. Closest Nodes Queries in a Binary Search Tree - 刷题找工作 EP405
16:35
On-Device Machine Learning from data to application - 机器学习 EP2
Hua Hua
On-Device Machine Learning from data to application - 机器学习 EP2
16:02
2022年的机器学习长什么样子?- 花花酱 机器学习 EP1
Hua Hua
2022年的机器学习长什么样子?- 花花酱 机器学习 EP1
23:57
花花酱 LeetCode 2441. Largest Positive Integer That Exists With Its Negative - 刷题找工作 EP404
Hua Hua
花花酱 LeetCode 2441. Largest Positive Integer That Exists With Its Negative - 刷题找工作 EP404
22:14
花花酱 LeetCode 2435. Paths in Matrix Whose Sum Is Divisible by K - 刷题找工作 EP403
Hua Hua
花花酱 LeetCode 2435. Paths in Matrix Whose Sum Is Divisible by K - 刷题找工作 EP403
11:55
花花酱 LeetCode 2416. Sum of Prefix Scores of Strings - 刷题找工作 EP402
Hua Hua
花花酱 LeetCode 2416. Sum of Prefix Scores of Strings - 刷题找工作 EP402
7:27
花花酱 LeetCode 2405. Optimal Partition of String- 刷题找工作 EP401
Hua Hua
花花酱 LeetCode 2405. Optimal Partition of String- 刷题找工作 EP401
11:01
花花酱 LeetCode 133. Clone Graph - 刷题找工作 EP400
Hua Hua
花花酱 LeetCode 133. Clone Graph - 刷题找工作 EP400
11:53
花花酱 Shallow Copy VS Deep Copy - CS大讲堂 EP18
Hua Hua
花花酱 Shallow Copy VS Deep Copy - CS大讲堂 EP18
14:06
花花酱 LeetCode 2166. Design Bitset - 刷题找工作 EP399
Hua Hua
花花酱 LeetCode 2166. Design Bitset - 刷题找工作 EP399
21:45
大厂软件开发之代码管理
Hua Hua
大厂软件开发之代码管理
17:51
[CC] Software development workflow feat. version control
Hua Hua
[CC] Software development workflow feat. version control
15:47
花花酱 LeetCode 2317. Maximum XOR After Operations - 刷题找工作 EP398
Hua Hua
花花酱 LeetCode 2317. Maximum XOR After Operations - 刷题找工作 EP398
13:11
花花酱 LeetCode 2316. Count Unreachable Pairs of Nodes in an Undirected Graph - 刷题找工作 EP397
Hua Hua
花花酱 LeetCode 2316. Count Unreachable Pairs of Nodes in an Undirected Graph - 刷题找工作 EP397
11:43
花花酱 LeetCode 2242 Maximum Score of a Node Sequence - 刷题找工作 EP396
Hua Hua
花花酱 LeetCode 2242 Maximum Score of a Node Sequence - 刷题找工作 EP396
13:04
LeetCode有史以来最简单的题目?2235. Add Two Integers
Hua Hua
LeetCode有史以来最简单的题目?2235. Add Two Integers
0:10
如何设计网络爬虫系统?How to Design Web Crawler - System Design EP3
Hua Hua
如何设计网络爬虫系统?How to Design Web Crawler - System Design EP3
16:28
如何搜索附近的商家? Geohash (下)
Hua Hua
如何搜索附近的商家? Geohash (下)
9:42
如何搜索附近的商家? Geohash (上)
Hua Hua
如何搜索附近的商家? Geohash (上)
17:59
LeetCode DP终极学习计划!Day9 | LC 139 Word Break【跟我一起写代码】
Hua Hua
LeetCode DP终极学习计划!Day9 | LC 139 Word Break【跟我一起写代码】
12:02
动态规划、二分法、分治法之间的区别和联系 - 刷题找工作 SP22
Hua Hua
动态规划、二分法、分治法之间的区别和联系 - 刷题找工作 SP22
19:13
花花酱 LeetCode 222. Count Complete Tree Nodes - 刷题找工作 EP395
Hua Hua
花花酱 LeetCode 222. Count Complete Tree Nodes - 刷题找工作 EP395
12:45
LeetCode DP终极学习计划!Day8 | Best Time to Buy and Sell Stock with Cooldown【跟我一起写代码】
Hua Hua
LeetCode DP终极学习计划!Day8 | Best Time to Buy and Sell Stock with Cooldown【跟我一起写代码】
13:42
LeetCode DP终极学习计划!Day7 | Best Time to Buy and Sell Stock【跟我一起写代码】
Hua Hua
LeetCode DP终极学习计划!Day7 | Best Time to Buy and Sell Stock【跟我一起写代码】
23:57
LeetCode DP终极学习计划!Day6 | Maximum Product Subarray【跟我一起写代码】
Hua Hua
LeetCode DP终极学习计划!Day6 | Maximum Product Subarray【跟我一起写代码】
17:20
LeetCode DP终极学习计划!Day5 Maximum Subarray【跟我一起写代码】
Hua Hua
LeetCode DP终极学习计划!Day5 Maximum Subarray【跟我一起写代码】
18:44
LeetCode DP终极学习计划!Day4 Jump Game I/II 【跟我一起写代码】
Hua Hua
LeetCode DP终极学习计划!Day4 Jump Game I/II 【跟我一起写代码】
15:13
LeetCode DP终极学习计划!Day1-3
Hua Hua
LeetCode DP终极学习计划!Day1-3
33:31
花花酱 LeetCode 1872. Stone Game VIII - 刷题找工作 EP394
Hua Hua
花花酱 LeetCode 1872. Stone Game VIII - 刷题找工作 EP394
17:25
花花酱 LeetCode 1847. Closest Room - 刷题找工作 EP393
Hua Hua
花花酱 LeetCode 1847. Closest Room - 刷题找工作 EP393
23:55
花花酱 LeetCode 1838. Frequency of the Most Frequent Element - 刷题找工作 EP392
Hua Hua
花花酱 LeetCode 1838. Frequency of the Most Frequent Element - 刷题找工作 EP392
12:52
花花酱 LeetCode 1815. Maximum Number of Groups Getting Fresh Donuts - 刷题找工作 EP391
Hua Hua
花花酱 LeetCode 1815. Maximum Number of Groups Getting Fresh Donuts - 刷题找工作 EP391
21:58
花花酱 LeetCode 1799. Maximize Score After N Operations - 刷题找工作 EP390
Hua Hua
花花酱 LeetCode 1799. Maximize Score After N Operations - 刷题找工作 EP390
14:57
花花酱 LeetCode 1792. Maximum Average Pass Ratio - 刷题找工作 EP389
Hua Hua
花花酱 LeetCode 1792. Maximum Average Pass Ratio - 刷题找工作 EP389
13:20
花花酱 LeetCode 1786. Number of Restricted Paths From First to Last Node - 刷题找工作 EP388
Hua Hua
花花酱 LeetCode 1786. Number of Restricted Paths From First to Last Node - 刷题找工作 EP388
23:02
花花酱 LeetCode 1775. Equal Sum Arrays With Minimum Number of Operations - 刷题找工作 EP387
Hua Hua
花花酱 LeetCode 1775. Equal Sum Arrays With Minimum Number of Operations - 刷题找工作 EP387
18:38
花花酱 LeetCode 1771. Maximize Palindrome Length From Subsequences - 刷题找工作 EP386
Hua Hua
花花酱 LeetCode 1771. Maximize Palindrome Length From Subsequences - 刷题找工作 EP386
12:58
花花酱 LeetCode 1770. Maximum Score from Performing Multiplication Operations - 刷题找工作 EP385
Hua Hua
花花酱 LeetCode 1770. Maximum Score from Performing Multiplication Operations - 刷题找工作 EP385
19:26
花花酱 LeetCode 1760. Minimum Limit of Balls in a Bag - 刷题找工作 EP384
Hua Hua
花花酱 LeetCode 1760. Minimum Limit of Balls in a Bag - 刷题找工作 EP384
17:38
花花酱 LeetCode 15. 3Sum - 刷题找工作 EP383
Hua Hua
花花酱 LeetCode 15. 3Sum - 刷题找工作 EP383
19:25
花花酱 LeetCode 1755. Closest Subsequence Sum - 刷题找工作 EP382
Hua Hua
花花酱 LeetCode 1755. Closest Subsequence Sum - 刷题找工作 EP382
15:13
花花酱 LeetCode 1745. Palindrome Partitioning IV - 刷题找工作 EP381
Hua Hua
花花酱 LeetCode 1745. Palindrome Partitioning IV - 刷题找工作 EP381
10:44
在C++里面用管道?C++20 Ranges - C++ Weekly EP5
Hua Hua
在C++里面用管道?C++20 Ranges - C++ Weekly EP5
23:13
花花酱 LeetCode 1727. Largest Submatrix With Rearrangements - 刷题找工作 EP380
Hua Hua
花花酱 LeetCode 1727. Largest Submatrix With Rearrangements - 刷题找工作 EP380
13:29
【LCS/LIS】花花酱 LeetCode 1713. Minimum Operations to Make a Subsequence - 刷题找工作 EP379
Hua Hua
【LCS/LIS】花花酱 LeetCode 1713. Minimum Operations to Make a Subsequence - 刷题找工作 EP379
11:56
花花酱 LeetCode 300 Longest Increasing Subsequence O(nlogn) - 刷题找工作 EP378
Hua Hua
花花酱 LeetCode 300 Longest Increasing Subsequence O(nlogn) - 刷题找工作 EP378
19:12
[CC] How to design Youtube/Bilibili? System Design EP2
Hua Hua
[CC] How to design Youtube/Bilibili? System Design EP2
25:10
花花酱 Consistent Hashing - CS大讲堂 EP17
Hua Hua
花花酱 Consistent Hashing - CS大讲堂 EP17
12:55
花花酱 LeetCode 1707. Maximum XOR With an Element From Array - 刷题找工作 EP377
Hua Hua
花花酱 LeetCode 1707. Maximum XOR With an Element From Array - 刷题找工作 EP377
22:49
[CC] How to Design Twitter - System Design EP1
Hua Hua
[CC] How to Design Twitter - System Design EP1
34:38
花花酱 LeetCode 1696. Jump Game VI - 刷题找工作 EP376
Hua Hua
花花酱 LeetCode 1696. Jump Game VI - 刷题找工作 EP376
14:50
花花酱 LeetCode 1690. Stone Game VII - 刷题找工作 EP375
Hua Hua
花花酱 LeetCode 1690. Stone Game VII - 刷题找工作 EP375
18:00
花花酱 LeetCode 1681. Minimum Incompatibility - 刷题找工作 EP374
Hua Hua
花花酱 LeetCode 1681. Minimum Incompatibility - 刷题找工作 EP374
18:02
花花酱 LeetCode 1674. Minimum Moves to Make Array Complementary - 刷题找工作 EP373
Hua Hua
花花酱 LeetCode 1674. Minimum Moves to Make Array Complementary - 刷题找工作 EP373
19:49
花花酱 LeetCode 1675. Minimize Deviation in Array - 刷题找工作 EP372
Hua Hua
花花酱 LeetCode 1675. Minimize Deviation in Array - 刷题找工作 EP372
13:09
花花酱 LeetCode 1659. Maximize Grid Happiness - 刷题找工作 EP371
Hua Hua
花花酱 LeetCode 1659. Maximize Grid Happiness - 刷题找工作 EP371
21:37
花花酱 Min Heap - 刷题找工作 SP21
Hua Hua
花花酱 Min Heap - 刷题找工作 SP21
20:43
花花酱 LeetCode 1655. Distribute Repeating Integers - 刷题找工作 EP370
Hua Hua
花花酱 LeetCode 1655. Distribute Repeating Integers - 刷题找工作 EP370
15:57
花花酱 LeetCode 1095. Find in Mountain Array - 刷题找工作 EP369
Hua Hua
花花酱 LeetCode 1095. Find in Mountain Array - 刷题找工作 EP369
12:15
云剪贴板GitHub Gist了解下?妈妈再也不用担心我的代码背不出来了...
Hua Hua
云剪贴板GitHub Gist了解下?妈妈再也不用担心我的代码背不出来了...
4:07
花花酱 LeetCode 1648. Sell Diminishing-Valued Colored Balls - 刷题找工作 EP368
Hua Hua
花花酱 LeetCode 1648. Sell Diminishing-Valued Colored Balls - 刷题找工作 EP368
16:40
花花酱 LeetCode 1206. Design Skiplist - 刷题找工作 EP367
Hua Hua
花花酱 LeetCode 1206. Design Skiplist - 刷题找工作 EP367
24:45
花花酱 LeetCode 1642. Furthest Building You Can Reach - 刷题找工作 EP366
Hua Hua
花花酱 LeetCode 1642. Furthest Building You Can Reach - 刷题找工作 EP366
16:53
花花酱 LeetCode 61. Rotate List - 刷题找工作 EP365
Hua Hua
花花酱 LeetCode 61. Rotate List - 刷题找工作 EP365
11:28
花花酱 LeetCode 1631. Path With Minimum Effort - 刷题找工作 EP364
Hua Hua
花花酱 LeetCode 1631. Path With Minimum Effort - 刷题找工作 EP364
15:31
花花酱 LeetCode 1621. Number of Sets of K Non-Overlapping Line Segments - 刷题找工作 EP363
Hua Hua
花花酱 LeetCode 1621. Number of Sets of K Non-Overlapping Line Segments - 刷题找工作 EP363
33:02
花花酱 LeetCode 1617. Count Subtrees With Max Distance Between Cities - 刷题找工作 EP362
Hua Hua
花花酱 LeetCode 1617. Count Subtrees With Max Distance Between Cities - 刷题找工作 EP362
25:11
花花酱 LeetCode 1616. Split Two Strings to Make Palindrome - 刷题找工作 EP361
Hua Hua
花花酱 LeetCode 1616. Split Two Strings to Make Palindrome - 刷题找工作 EP361
10:33
花花酱 LeetCode 1610. Maximum Number of Visible Points - 刷题找工作 EP360
Hua Hua
花花酱 LeetCode 1610. Maximum Number of Visible Points - 刷题找工作 EP360
10:34
花花酱 LeetCode 1606. Find Servers That Handled Most Number of Requests - 刷题找工作 EP359
Hua Hua
花花酱 LeetCode 1606. Find Servers That Handled Most Number of Requests - 刷题找工作 EP359
14:05
花花酱 LeetCode 1595. Minimum Cost to Connect Two Groups of Points - 刷题找工作 EP358
Hua Hua
花花酱 LeetCode 1595. Minimum Cost to Connect Two Groups of Points - 刷题找工作 EP358
11:47
花花酱 LeetCode 1593. Split a String Into the Max Number of Unique Substrings - 刷题找工作 EP357
Hua Hua
花花酱 LeetCode 1593. Split a String Into the Max Number of Unique Substrings - 刷题找工作 EP357
10:52
花花酱 LeetCode 1585. Check If String Is Transformable With Substring Sort Operations - 刷题找工作 EP356
Hua Hua
花花酱 LeetCode 1585. Check If String Is Transformable With Substring Sort Operations - 刷题找工作 EP356
15:33
花花酱 LeetCode 1579. Remove Max Number of Edges to Keep Graph Fully Traversable - 刷题找工作 EP355
Hua Hua
花花酱 LeetCode 1579. Remove Max Number of Edges to Keep Graph Fully Traversable - 刷题找工作 EP355
9:26
花花酱 LeetCode 1573. Number of Ways to Split a String - 刷题找工作 EP354
Hua Hua
花花酱 LeetCode 1573. Number of Ways to Split a String - 刷题找工作 EP354
10:41
花花酱 LeetCode 1569. Number of Ways to Reorder Array to Get Same BST - 刷题找工作 EP363
Hua Hua
花花酱 LeetCode 1569. Number of Ways to Reorder Array to Get Same BST - 刷题找工作 EP363
12:31
花花酱 LeetCode 1563. Stone Game V - 刷题找工作 EP352
Hua Hua
花花酱 LeetCode 1563. Stone Game V - 刷题找工作 EP352
10:35
花花酱 LeetCode 1558. Minimum Numbers of Function Calls to Make Target Array - 刷题找工作 EP351
Hua Hua
花花酱 LeetCode 1558. Minimum Numbers of Function Calls to Make Target Array - 刷题找工作 EP351
11:21
花花酱 LeetCode 1553. Minimum Number of Days to Eat N Oranges - 刷题找工作 EP350
Hua Hua
花花酱 LeetCode 1553. Minimum Number of Days to Eat N Oranges - 刷题找工作 EP350
16:16
花花酱 LeetCode 1542. Find Longest Awesome Substring - 刷题找工作 EP349
Hua Hua
花花酱 LeetCode 1542. Find Longest Awesome Substring - 刷题找工作 EP349
17:29
花花酱 LeetCode 887. Super Egg Drop - 刷题找工作 EP 348
Hua Hua
花花酱 LeetCode 887. Super Egg Drop - 刷题找工作 EP 348
23:50
花花酱 LeetCode 1531. String Compression II - 刷题找工作 EP347
Hua Hua
花花酱 LeetCode 1531. String Compression II - 刷题找工作 EP347
30:51
花花酱 LeetCode 1530. Number of Good Leaf Nodes Pairs - 刷题找工作 EP346
Hua Hua
花花酱 LeetCode 1530. Number of Good Leaf Nodes Pairs - 刷题找工作 EP346
23:23
花花酱 LeetCode 1524. Number of Sub-arrays With Odd Sum - 刷题找工作 EP345
Hua Hua
花花酱 LeetCode 1524. Number of Sub-arrays With Odd Sum - 刷题找工作 EP345
12:29
花花酱 LeetCode 1520. Maximum Number of Non-Overlapping Substrings - 刷题找工作 EP344
Hua Hua
花花酱 LeetCode 1520. Maximum Number of Non-Overlapping Substrings - 刷题找工作 EP344
24:59
Why grid[y][x] instead of grid[x][y]? - CS大讲堂 EP16
Hua Hua
Why grid[y][x] instead of grid[x][y]? - CS大讲堂 EP16
10:26
花花酱 LeetCode 1508. Range Sum of Sorted Subarray Sums - 刷题找工作 EP343
Hua Hua
花花酱 LeetCode 1508. Range Sum of Sorted Subarray Sums - 刷题找工作 EP343
25:05