![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
topcoder
文章平均质量分 68
_TianZhirui
我比昨天更强???
展开
-
SRM723 A
主要涉及正则表达式,还有Java的charAt用法。 一句话:字符串匹配问题 package topcoder; import java.util.*; import java.util.regex.*; import java.text.*; import java.math.*; public class BuffaloBuffalo { public String ch原创 2017-11-21 22:05:48 · 154 阅读 · 0 评论 -
递归专题:01迷宫问题
//迷宫问题 Scenario #2: Multiple Related Decisions When our program only has to make one decision, our approach can be fairly simple. We loop through each of the options for our decision, evalua原创 2018-01-27 17:16:34 · 556 阅读 · 0 评论 -
Single Round Match 728 Round 1 - Division II, Level Two
Problem Statement for IncreasingSequencesEasy Problem Statement You are given two int[]s L and R, each of length n. Find the number of strictly increa原创 2018-01-29 18:53:35 · 246 阅读 · 0 评论 -
每日坚持五道题目:2018/03/20:SRM731DIV2B DancingClass
Problem Statement Hero is going to give a dancing class. Exactly n students already signed up for the class. Hero doesn't know the genders of those students, so he makes the simplifying ass原创 2018-03-20 16:24:45 · 190 阅读 · 0 评论 -
make_pair用法
#include<bits/stdc++.h> using namespace std; #define mp make_pair class DeckOfCards{ string IsValid(int n,vector<int>value,string suit) { set<pair<int,char>>deck; for(...原创 2018-03-30 11:01:40 · 820 阅读 · 0 评论