leetcode1108-1111、1114-1117

1108.IP地址无效化

public String defangIPaddr(String address) {StringBuffer res = new StringBuffer();for(int i = 0;i < address.length();i++){char c = address.charAt(i);if(c != '.'){res.append(c);}else {res.append('[');res.append(c);res.append(']');}}return res.toString();
}

航班预订统计

public int[] corpFlightBookings(int[][] bookings, int n) {int[] res = new int[n];for(int i = 0; i < bookings.length;i++){int start = bookings[i][0];int end = bookings[i][1];res[start - 1] += bookings[i][2];if(end < n)res[end] -= bookings[i][2];}for(int i = 1;i < res.length;i++){res[i] += res[i-1];}return res;
}

删点成林

public List<TreeNode> delNodes(TreeNode root, int[] to_delete) {List<TreeNode> res = new LinkedList<>();Set<Integer> delete = new HashSet<>();for(int node:to_delete){delete.add(node);}postdelete(root, res, delete);if(!delete.contains(root.val)){res.add(root);}return res;
}public void postdelete(TreeNode root, List<TreeNode> res, Set<Integer> delete) {if(root == null)return;postdelete(root.left, res, delete);postdelete(root.right, res, delete);if(delete.contains(root.val)){if(root.left != null){if(!delete.contains(root.left.val)){res.add(root.left);root.left = null;}}if(root.right != null){if(!delete.contains(root.right.val)){res.add(root.right);root.right = null;}}} else {if(root.left != null){if(delete.contains(root.left.val)){root.left = null;}}if(root.right != null){if(delete.contains(root.right.val)){root.right = null;}}}
}

有效括号的嵌套深度

public int[] maxDepthAfterSplit(String seq) {int[] res = new int[seq.length()];int deep = 0;for(int i = 0;i < seq.length();i++){if(seq.charAt(i) == '('){deep++;if(deep % 2 == 0){res[i] = 1;}} else {deep--;if(deep % 2 == 1){res[i] = 1;}}}return res;
}

按序打印

class Foo {
private CountDownLatch countDownLatchA;
private CountDownLatch countDownLatchB;public Foo() {countDownLatchA = new CountDownLatch(1);countDownLatchB = new CountDownLatch(1);
}public void first(Runnable printFirst) throws InterruptedException {// printFirst.run() outputs "first". Do not change or remove this line.printFirst.run();countDownLatchA.countDown();
}public void second(Runnable printSecond) throws InterruptedException {countDownLatchA.await();// printSecond.run() outputs "second". Do not change or remove this line.printSecond.run();countDownLatchB.countDown();
}public void third(Runnable printThird) throws InterruptedException {countDownLatchB.await();// printThird.run() outputs "third". Do not change or remove this line.printThird.run();
}
}

交替打印FooBar

class FooBar {
private int n;
private final Semaphore semaphoreFoo;
private final Semaphore semaphoreBar;public FooBar(int n) {this.n = n;semaphoreFoo = new Semaphore(0);semaphoreBar = new Semaphore(0);
}public void foo(Runnable printFoo) throws InterruptedException {for (int i = 0; i < n; i++) {// printFoo.run() outputs "foo". Do not change or remove this line.printFoo.run();semaphoreBar.release();semaphoreFoo.acquire();}
}public void bar(Runnable printBar) throws InterruptedException {for (int i = 0; i < n; i++) {semaphoreBar.acquire();// printBar.run() outputs "bar". Do not change or remove this line.printBar.run();semaphoreFoo.release();}
}
}

打印零与奇偶数

class ZeroEvenOdd {
private int n;
private final Semaphore z;
private final Semaphore e;
private final Semaphore o;public ZeroEvenOdd(int n) {this.n = n;z = new Semaphore(1);e = new Semaphore(0);o = new Semaphore(0);
}// printNumber.accept(x) outputs "x", where x is an integer.
public void zero(IntConsumer printNumber) throws InterruptedException {for (int i = 0; i < n; i++) {z.acquire();printNumber.accept(0);if(i % 2 == 0){o.release();} else {e.release();}}
}public void even(IntConsumer printNumber) throws InterruptedException {for (int i = 2; i <= n; i+=2) {e.acquire();printNumber.accept(i);z.release();}
}public void odd(IntConsumer printNumber) throws InterruptedException {for (int i = 1; i <= n; i+=2) {o.acquire();printNumber.accept(i);z.release();}
}
}

H2O 生成

class H2O {
private Semaphore h;
private Semaphore o;public H2O() {h = new Semaphore(2);o = new Semaphore(0);
}public void hydrogen(Runnable releaseHydrogen) throws InterruptedException {h.acquire(1);// releaseHydrogen.run() outputs "H". Do not change or remove this line.releaseHydrogen.run();o.release(1);
}public void oxygen(Runnable releaseOxygen) throws InterruptedException {o.acquire(2);// releaseOxygen.run() outputs "H". Do not change or remove this line.releaseOxygen.run();h.release(2);
}
}

leetcode1108-1111、1114-1117相关推荐

c语言在键盘输入abc回车,C语言期末考试试卷子商务1111、21.doc
C语言期末考试试卷子商务1111.21 (所有题目答案请写在答题纸上) 一.单项选择题(每题2分, 共60分) 键盘输入为"123 ABC"时,下列程序的输出为_______ #i ...
caioj1522: [NOIP提高组2005]过河
状态压缩的经典题. 按照一般做法,DP一维时间O(n),显然跑不过.考虑到石子较少,实际上有很长一段是一定可以跳到的,设两个石头分别在i点和j点,跳跃的路程为S到T.那么从i点可以跳到i+S到i+T. ...
AI：IPPR的数学表示-CNN结构进化（Alex、ZF、Inception、Res、InceptionRes）
前言: 深度学习:sigmod.tanh.ReLU函数的优缺点-文章图文并举:文章:CNN的结构分析--: 文章:历年ImageNet冠军模型网络结构解析---: 文章:GoogleLeNet系列解 ...
[pytorch、学习] - 5.8 网络中的网络（NiN）
参考 5.8 网络中的网络(NiN) 前几节介绍的LeNet.AlexNet和VGG在设计上的共同之处是:先以由卷积层构成的模块充分抽取空间特征,再以由全连接层构成的模块来输出分类结果.其中,Alex ...
.net 怎么循环得到数组里的值_HashMap 底层实现、加载因子、容量值及死循环
写在前面:2020年面试必备的Java后端进阶面试题总结了一份复习指南在Github上,内容详细,图文并茂,有需要学习的朋友可以Star一下! GitHub地址:abel-max/Java-Study ...
CNN中各类卷积总结：残差、shuffle、空洞卷积、变形卷积核、可分离卷积等
CNN从2012年的AlexNet发展至今,科学家们发明出各种各样的CNN模型,一个比一个深,一个比一个准确,一个比一个轻量.我下面会对近几年一些具有变革性的工作进行简单盘点,从这些充满革新性的工作中 ...
实验四——DPCM编码（1bit、2bit、4bit、8bit量化）
一.实验要求本实验的目标是验证DPCM编码的编码效率.首先读取一个256级的灰度图像,采用自己设定的预测方法计算预测误差(本次实验报告使用左向预测),并对预测误差进行8比特均匀量化(基本要求).还可 ...
Python 入门 26 —— ASCII 编码、Unicode 编码、 UTF-32、 UTF-16、 UTF-8、 GB2312 编码、 GBK 编码
计算机存储和处理信息都是以一个8位的二进制字节为单位的,例如:0b 1111 0000.一个字母.汉字等如何用一个二进制的数(编码)来表示呢.在计算机发展初期,因为没有人能预料到计算机会有现在这么大的 ...
正则匹配判断电话号码是否真实、几连号、几顺序号
正则匹配判断电话号码是否真实.几连号.几顺序号正则匹配 1.主要是从输入的字符串中匹配出满足条件的字符串,即判断是否为电话号码. 2.电话号码的连号和顺序号判断,主要是通过正则匹配式将相应的字符串匹 ...
鲸探发布点评：9月20日发售FPX戒指、中山大学号科考船数字藏品
今天鲸探将发2款藏品:<FPX名人堂·至臻荣誉戒指>.<中山大学号海洋综合科考船>,发行价格18,发行数量10000*2. <FPX名人堂·至臻荣誉戒指>是为表彰. ...

leetcode1108-1111、1114-1117

leetcode1108-1111、1114-1117相关推荐

最新文章

热门文章