JZ3 连续子数组的最大和
题源 👉数组中重复的数字_牛客题霸_牛客网 (nowcoder.com)
题目描述:
具体实现:
方法一:哈希表
public int duplicate (int[] numbers) {
HashMap<Integer,Integer> map = new HashMap<>();
for(int i = 0; i < numbers.length; i++){
if(map.containsKey(numbers[i])) return numbers[i]; // 出现过
else map.put(numbers[i], 1);
}
return -1; // 无重复
}
时间:O(n)
空间:O(n)
方法二:位置重排 👉 题解 | #数组中重复的数字#_牛客博客 (nowcoder.net)
public int duplicate (int[] numbers) {
for(int i = 0; i < numbers.length; i++){
if(numbers[i] == i) continue;
if(numbers[i] == numbers[numbers[i]]) return numbers[i];
else{
swap(numbers, i, numbers[i]);
i--;
}
}
return -1;
}
public void swap(int[] arr, int a, int b){
int temp = arr[a];
arr[a] = arr[b];
arr[b] = temp;
}
JZ5 替换空格
题源 👉 替换空格_牛客题霸_牛客网 (nowcoder.com)
题目描述:
具体实现:
- 方法一:
public String replaceSpace (String s) {
StringBuilder sb = new StringBuilder();
for(int i = 0; i < s.length(); i++){
if(s.charAt(i) == ' ')
sb.append("%20");
else
sb.append(s.charAt(i));
}
return sb.toString();
}
时间:O(n)
空间:O(1)
JZ7 重建二叉树
题源 👉 重建二叉树_牛客题霸_牛客网 (nowcoder.com)
题目描述
具体实现:
方法一:递归 👉 题解 | #重建二叉树#_牛客博客 (nowcoder.net)
import java.util.*;
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode reConstructBinaryTree(int [] pre,int [] vin) {
int n = pre.length;
int m = vin.length;
if(n == 0 || m == 0) return null;
TreeNode root = new TreeNode(pre[0]);
for(int i = 0; i < vin.length; i++){
if(pre[0] == vin[i]){
root.left = reConstructBinaryTree(Arrays.copyOfRange(pre, 1, i+1), Arrays.copyOfRange(vin, 0, i));
root.right = reConstructBinaryTree(Arrays.copyOfRange(pre, i+1, n), Arrays.copyOfRange(vin, i+1, m));
break;
}
}
return root;
}
}
时间:O(n)
空间:O(n)
方法二:栈 👉 题解 | #重建二叉树#_牛客博客 (nowcoder.net)