2019年9月16日

LeetCode: 104. Maximum Depth of Binary Tree-简单-Python+Java

摘要： Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文

posted @ 2019-09-16 11:19 cherryjing0629 阅读(116) 评论(0) 推荐(0) 编辑

LeetCode: 344. Reverse String-简单-Python+Java

摘要： 344. Reverse String Write a function that reverses a string. The input string is given as an array of characters char[]. Do not allocate extra space f 阅读全文

posted @ 2019-09-16 11:03 cherryjing0629 阅读(125) 评论(0) 推荐(0) 编辑

导航