Coney Island is a magic place...
转载
精选
2010-12-19 14:23:53
157阅读
Easter island is one of the most mystery islands in the
原创
2022-08-04 13:06:58
29阅读
Treasure of the Chimp Island Problem Description Bob Bennett, the young adventurer, has found the map to the treasure of the Chimp Island, where the g
转载
2016-11-15 14:43:00
73阅读
2评论
https://leetcode.com/problems/island-perimeter/
转载
2016-11-21 15:29:00
73阅读
2评论
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is completely...
转载
2016-12-13 08:37:00
76阅读
2评论
题目链接：https://cn.vjudge.net/contest/208908#problem/H大致题意：给你t个老虎和d个小鹿，再加上你，按照题目描述的规则每天随机抽取两个，问你存活的概率。题解：按照题意，我们知道只有老虎才能吃老虎，并且他们会同归于尽，所以很容易想到当老虎的个数为奇数个时人一定不能存活，当老虎的数量为0时，人一定能存活，剩下的就是老虎的数量为偶数的情况了。我们知道
原创
2021-09-04 22:15:37
125阅读
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represen
原创
2022-08-03 17:01:25
23阅读
You are given a map in form of a two-dimensional integer grid where 1 represents land and
原创
2022-08-23 19:21:34
93阅读
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/ve
转载
2017-02-01 21:04:00
18阅读
2评论
You are given a map in form of a two dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/ve
转载
2018-10-30 12:09:00
17阅读
2评论
463. Island Perimeter*You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water.Grid
原创
2022-05-30 10:26:30
79阅读
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/ve
转载
2020-07-08 01:30:00
30阅读
2评论
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/ve
转载
2018-11-19 08:09:00
31阅读
2评论
题目大意： 找基环树直径 （这个题输入给出的是内向基环树（虽然是无向边）） 存在两种情况： 1.直径在树上。 2.直径从树里走到环上，再走进另外一个树里。 首先dfs找到环。 第一种直接树形dp。dp[i]i往下最长路径。还能用来求第二种情况。 第二种，找到环之后，断环成链，复制一倍。求的是，选择距
转载
2018-11-04 11:07:00
27阅读
2评论
LeetCode Java Island Perimeter
原创
2022-08-25 12:26:51
38阅读
题目：
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is co
原创
2023-03-07 12:37:30
61阅读
1、题目You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is c
原创
2021-08-12 15:46:34
114阅读
1、题目You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is c
原创
2022-03-11 10:20:22
40阅读
"嘟嘟嘟" 一句话题意：求带权基环树森林中每一个联通块的最长路之和，路径为简单路径。 其实这道题不难，只不过是吧好多知识拼接在了一起。 看到基环树，就会想到断环为链，为了能枚举到所有路径，要把链翻倍乘2。 现在得到了一个序列，上面的每一个点表示外向树的树根。 那么一条最长路可能有两种情况： 1.单独
原创
2021-05-29 19:25:25
648阅读
题目链接：点击打开链接#include #include #include #include #include #include using namespace std;const long double eps = 1e-13;#define y1 Y1long double area(long double x1, long double y1, long double
原创
2021-08-13 14:11:48
94阅读
