LeetCode题解（八）0700-0799

1 3

In the example above, if we want to search the value 5, since there is no node with value 5, we should return NULL.

Note that an empty tree is represented by NULL, therefore you would see the expected output (serialized tree format) as [], not null.

[Answer]

Runtime: 0 ms, faster than 100.00% of Java online submissions for Search in a Binary Search Tree.

Memory Usage: 38.2 MB, less than 99.82% of Java online submissions for Search in a Binary Search

/**

• Definition for a binary tree node.

• public class TreeNode {

• int val;
  

• TreeNode left;
  

• TreeNode right;
  

• TreeNode(int x) { val = x; }
  

• }

*/

class Solution {

public TreeNode searchBST(TreeNode root, int val) {

if (root == null)

return root;

if (root.val == val)

return root;

else if (val < root.val)

return searchBST(root.left, val);

else

return searchBST(root.right, val);

}

}

709. To Lower Case

[Description]

Implement function ToLowerCase() that has a string parameter str, and returns the same string in lowercase.

[Example]

Example 1:

Input: “Hello”

Output: “hello”

Example 2:

Input: “here”

Output: “here”

Example 3:

Input: “LOVELY”

Output: “lovely”

[Answer]

Runtime: 0 ms, faster than 100.00% of Java online submissions for To Lower Case.

Memory Usage: 34.1 MB, less than 99.91% of Java online submissions for To Lower Case.

class Solution {

public String toLowerCase(String str) {

return str.toLowerCase();

}

}

Runtime: 0 ms, faster than 100.00% of Java online submissions for To Lower Case.

Memory Usage: 34 MB, less than 99.91% of Java online submissions for To Lower Case.

class Solution {

public String toLowerCase(String str) {

char[] arrayChar = str.toCharArray();

for (int i = 0; i < arrayChar.length; i++) {

if (arrayChar[i] >= ‘A’ && arrayChar[i] <= ‘Z’)

arrayChar[i] += 32;

}

return new String(arrayChar);

}

}

class Solution {

public String toLowerCase(String str) {

StringBuilder sb = new StringBuilder();

for (char c : str.toCharArray()) {

if ((c - 0) >= 65 && (c - 0) <= 90) {

sb.append(Character.toChars(c + 32));

} else {

sb.append©;

}

}

return sb.toString();

}

}

728. Self Dividing Numbers

[Description]

A self-dividing number is a number that is divisible by every digit it contains.

For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.

Also, a self-dividing number is not allowed to contain the digit zero.

Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.

Example 1:

Input:

left = 1, right = 22

Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]

Note:

The boundaries of each input argument are 1 <= left <= right <= 10000.

[Answer]

Runtime: 7 ms, faster than 13.00% of Java online submissions for Self Dividing Numbers.

Memory Usage: 36.2 MB, less than 33.49% of Java online submissions for Self Dividing Numbers.

class Solution {

public List selfDividingNumbers(int left, int right) {

List list = new ArrayList();

while (left <= right) {

if (isSelfNumber(left))

list.add(left);

left++;

}

return list;

}

private boolean isSelfNumber(int num) {

if (num < 1)

return false;

if (num < 10)

return true;

String str = num + “”;

if (str.contains(“0”))

return false;

for (char c : str.toCharArray()) {

int n = Integer.parseInt(“” + c);

if (num % n != 0)

最后

自我介绍一下，小编13年上海交大毕业，曾经在小公司待过，也去过华为、OPPO等大厂，18年进入阿里一直到现在。

深知大多数初中级Android工程师，想要提升技能，往往是自己摸索成长，自己不成体系的自学效果低效漫长且无助。

因此我收集整理了一份《2024年Android移动开发全套学习资料》，初衷也很简单，就是希望能够帮助到想自学提升又不知道该从何学起的朋友，同时减轻大家的负担。

既有适合小白学习的零基础资料，也有适合3年以上经验的小伙伴深入学习提升的进阶课程，基本涵盖了95%以上Android开发知识点！不论你是刚入门Android开发的新手，还是希望在技术上不断提升的资深开发者，这些资料都将为你打开新的学习之门

如果你觉得这些内容对你有帮助，需要这份全套学习资料的朋友可以戳我获取！！

由于文件比较大，这里只是将部分目录截图出来，每个节点里面都包含大厂面经、学习笔记、源码讲义、实战项目、讲解视频，并且会持续更新！
-1715759024471)]

既有适合小白学习的零基础资料，也有适合3年以上经验的小伙伴深入学习提升的进阶课程，基本涵盖了95%以上Android开发知识点！不论你是刚入门Android开发的新手，还是希望在技术上不断提升的资深开发者，这些资料都将为你打开新的学习之门

如果你觉得这些内容对你有帮助，需要这份全套学习资料的朋友可以戳我获取！！

由于文件比较大，这里只是将部分目录截图出来，每个节点里面都包含大厂面经、学习笔记、源码讲义、实战项目、讲解视频，并且会持续更新！