剑指 Offer II 042. 最近请求次数【简单题】
思路:
使用队列模拟
代码:
class RecentCounter {
Deque<Integer> deque;
int cnt;
public RecentCounter() {
this.deque = new ArrayDeque<>();
this.cnt = 0;
}
public int ping(int t) {
deque.offer(t);
cnt++;
while (deque.getFirst() < t - 3000){
deque.poll();
cnt--;
}
return cnt;
}
}
/**
* Your RecentCounter object will be instantiated and called as such:
* RecentCounter obj = new RecentCounter();
* int param_1 = obj.ping(t);
*/
剑指 Offer II 043. 往完全二叉树添加节点【中等题】
思路:【队列】
不会写,看的评论区题解 日就月将
代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class CBTInserter {
Queue<TreeNode> deque;
TreeNode root;
//标记待插入节点的父节点
TreeNode parent;
public CBTInserter(TreeNode root) {
this.root = root;
deque = new ArrayDeque<>();
deque.offer(root);
while(!deque.isEmpty()){
TreeNode node = deque.poll();
if(node.left != null){
deque.offer(node.left);
}
if(node.right != null){
deque.offer(node.right);
}else{
//完全二叉树 left为空时,right必为空 因此
//不管left是否为空 当right为空时,说明我们找到了二叉树的结尾,记录二叉树结尾的父节点,退出循环
this.parent = node;
break;
}
}
}
public int insert(int v) {
int res = 0;
TreeNode node = new TreeNode(v);
if(parent.left == null){
parent.left = node;
res = parent.val;
}else if(parent.right == null){
parent.right = node;
res = parent.val;
//当前父节点已占用完毕 标记下一个父节点
parent = deque.poll();
}
//将当前节点添加到父节点候选队列中
deque.offer(node);
return res;
}
public TreeNode get_root() {
return root;
}
}
/**
* Your CBTInserter object will be instantiated and called as such:
* CBTInserter obj = new CBTInserter(root);
* int param_1 = obj.insert(v);
* TreeNode param_2 = obj.get_root();
*/