码迷,mamicode.com
首页 >  
搜索关键字:actionbar up    ( 8653个结果
UVA11559 Event Planning【水题】
As you didn’t show up to the yearly general meeting of the Nordic Club of Pin Collectors, you were unanimously elected to organize this years excursio ...
分类:其他好文   时间:2019-02-10 09:37:25    阅读次数:188
A1088.Rational Arithmetic
题意 模拟分数的四则运算 思路分析 模拟,在输出过程中,若分子 分母,需要分离出整数部分与分数部分,并且如果项为负数需要带上 c++ include using namespace std; typedef long long ll; struct fraction{ ll up; //分子 ll ...
分类:其他好文   时间:2019-02-08 23:34:16    阅读次数:216
What Goes Up UVA - 481 LIS+打印路径 【模板】
打印严格上升子序列; ...
分类:其他好文   时间:2019-02-07 10:48:23    阅读次数:177
LeetCode-144-Binary Tree Preorder Traversal
算法描述: Given a binary tree, return the preorder traversal of its nodes' values. Example: Follow up: Recursive solution is trivial, could you do it iter ...
分类:其他好文   时间:2019-02-06 18:35:55    阅读次数:109
[Daily Coding Problem 70] Nth perfect number
This problem was asked by Microsoft. A number is considered perfect if its digits sum up to exactly 10. Given a positive integer n, return the n-th pe ...
分类:其他好文   时间:2019-02-06 09:26:03    阅读次数:187
Gym - 101806T: Touch The Sky(贪心)
Figure: The house floats up in the sky by balloons. This picture is also used in 2018 KAIST RUN Spring Contest poster. In the year 2117, Professor Jae ...
分类:其他好文   时间:2019-02-05 22:22:11    阅读次数:146
gitlab账号注册及分组
1.开启注册邮箱验证 admin area --》setting--》Sign-up restrictions--》勾选Send confirmation email on sign-up 2.当前用户 root、123、xxxx 3.创建组 首页->create a group(http://19... ...
分类:其他好文   时间:2019-02-05 22:20:20    阅读次数:927
What is Zeebe?
转自:https://zeebe.io/what-is-zeebe/ Zeebe is a workflow engine for microservices orchestration. This write-up will help you understand exactly what Zee ...
分类:其他好文   时间:2019-02-04 20:58:12    阅读次数:214
leetcode 206. Reverse Linked List
Reverse a singly linked list. Example: Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both? 解法一:遍历(我的 ...
分类:其他好文   时间:2019-02-02 20:36:53    阅读次数:159
CF1065F Up and Down the Tree
题解: 和正解方法不太一样 正解的大概意思就是先向下走可以走回来的 再走不能走回来的 能走回来的就是到这个儿子后最近的叶子可以返回的 然后这样可以O(n)计算 我自己做的时候以为这样不太能做。。 所以用的是哪些点可以返回当前点 途中可以利用其它叶子 可以发现如果可以利用其他叶子到达,那多个的时候也可 ...
分类:其他好文   时间:2019-02-02 17:30:59    阅读次数:168
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!