模拟
YancyKahn
这个作者很懒,什么都没留下…
展开
-
【Leetcode每日一题】738. 单调递增的数字(模拟)
Leetcode每日一题题目链接: 738. 单调递增的数字难度: 中等解题思路: 从地位到高位进行模拟,若当前位的值小于高位的指,那么当前位就要向高位借位,并且当前位的指赋值为9。考虑到有0出现,所以在最后还需要进行一次处理,若当前位为题解:class Solution: def monotoneIncreasingDigits(self, N: int) -> int: digit = [int(d) for d in str(N)] flag原创 2020-12-15 11:00:26 · 238 阅读 · 0 评论 -
POJ-1208(The Blocks Problems)
题目链接: POJ - 1028notice :Any command in which a = b or in which a and b are in the same stack ofblocks is an illegal command. All illegal commands should be ignored andshould have no affect on the原创 2018-01-27 11:36:55 · 559 阅读 · 0 评论 -
POJ-1028(Web Navigation)
POJ-1028#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <stack>using namespace std;const char VISIT[] = "VISIT";const char BACK[] = "BACK";const char FORWARD[]原创 2018-01-27 14:57:59 · 358 阅读 · 0 评论 -
CCF-20180903 元素选择器
20180903 元素选择器题意: 找出给定html文档的对应元素所在位置。分析: 字符串问题大模拟, CCF经典题。代码: 这道题只得了80分, 还在找bug。#include &lt;bits/stdc++.h&gt;using namespace std;const int MAXN = 111;struct Item //html文档{ int do...原创 2018-11-26 11:49:34 · 644 阅读 · 0 评论