johnny_zhao - 博客园

2020年11月10日

摘要： package LeetCode_1302 import java.util.* /** * 1302. Deepest Leaves Sum * https://leetcode.com/problems/deepest-leaves-sum/ * Given a binary tree, ret 阅读全文

posted @ 2020-11-10 17:49 johnny_zhao 阅读(34) 评论(0) 推荐(0) 编辑

1315. Sum of Nodes with Even-Valued Grandparent

摘要： package LeetCode_1315 import java.util.* /** * 1315. Sum of Nodes with Even-Valued Grandparent * https://leetcode.com/problems/sum-of-nodes-with-even- 阅读全文

posted @ 2020-11-10 16:25 johnny_zhao 阅读(82) 评论(0) 推荐(0) 编辑

679. 24 Game

摘要： package LeetCode_679 /** * 679. 24 Game * https://leetcode.com/problems/24-game/ * * You have 4 cards each containing a number from 1 to 9. * You need 阅读全文

posted @ 2020-11-10 15:48 johnny_zhao 阅读(81) 评论(0) 推荐(0) 编辑

2020年11月9日

8. String to Integer (atoi)

摘要： package LeetCode_8 /** * 8. String to Integer (atoi) * https://leetcode.com/problems/string-to-integer-atoi/ * * Implement atoi which converts a strin 阅读全文

posted @ 2020-11-09 12:38 johnny_zhao 阅读(77) 评论(0) 推荐(0) 编辑

1649. Create Sorted Array through Instructions

摘要： package LeetCode_1649 /** * 1649. Create Sorted Array through Instructions * https://leetcode.com/problems/create-sorted-array-through-instructions/ * 阅读全文

posted @ 2020-11-09 11:06 johnny_zhao 阅读(151) 评论(0) 推荐(0) 编辑

2020年11月8日

1331. Rank Transform of an Array

摘要： package LeetCode_1331 import java.util.* import kotlin.collections.HashMap /** * 1331. Rank Transform of an Array * https://leetcode.com/problems/rank 阅读全文

posted @ 2020-11-08 16:33 johnny_zhao 阅读(118) 评论(0) 推荐(0) 编辑

1646. Get Maximum in Generated Array

摘要： package LeetCode_1646 /** * 1646. Get Maximum in Generated Array * https://leetcode.com/problems/get-maximum-in-generated-array/ * * You are given an 阅读全文

posted @ 2020-11-08 15:44 johnny_zhao 阅读(105) 评论(0) 推荐(0) 编辑

1647. Minimum Deletions to Make Character Frequencies Unique

摘要： package LeetCode_1647 import java.util.* import kotlin.collections.HashMap /** * 1647. Minimum Deletions to Make Character Frequencies Unique * https: 阅读全文

posted @ 2020-11-08 12:34 johnny_zhao 阅读(275) 评论(0) 推荐(0) 编辑

2020年11月7日

670. Maximum Swap

摘要： package LeetCode_670 /** * 670. Maximum Swap * https://leetcode.com/problems/maximum-swap/description/ * * Given a non-negative integer, you could swa 阅读全文

posted @ 2020-11-07 23:17 johnny_zhao 阅读(98) 评论(0) 推荐(0) 编辑

662. Maximum Width of Binary Tree (DFS, BFS)

摘要： package LeetCode_662 import java.util.* import kotlin.collections.ArrayList /** * 662. Maximum Width of Binary Tree * https://leetcode.com/problems/ma 阅读全文

posted @ 2020-11-07 17:17 johnny_zhao 阅读(89) 评论(0) 推荐(0) 编辑

Keep Learning

公告