Android
文章平均质量分 57
Android
mmk27
这个作者很懒,什么都没留下…
展开
-
温故知新 - View 的绘制流程
view 绘制流程原创 2022-09-04 14:44:24 · 377 阅读 · 1 评论 -
Android 三种动画 (帧动画 、补间动画、属性动画)
安卓的三种动画原创 2022-09-04 14:33:35 · 4302 阅读 · 0 评论 -
HDU - 3336 Count the string kmp+dp
题目链接:https://cn.vjudge.net/problem/HDU-3336题意:字符串所有前缀的出现次数题解:dp[ i ] 表示以i为结尾i 前缀的个数 ,所以dp[i] = dp[nex[i] ] + 1#include <bits/stdc++.h>using namespace std;const int N = 200100;const ...原创 2019-08-06 13:13:31 · 131 阅读 · 0 评论 -
HDU - 3374 String Problem 最小最大表示法+循环节
题目链接:https://cn.vjudge.net/problem/HDU-3374题意:向左移动【0, len-1】次,形成的n个串,求最小和最大串的起始位置,和有多少个题解:求数目的话,直接找最小循环节即可,最小最大串位置直接最大最小表示法找就可以了。#include <bits/stdc++.h>using namespace std;const int N ...原创 2019-08-06 12:29:18 · 166 阅读 · 0 评论 -
HDU - 2328 Corporate Identity / POJ - 3080 Blue Jeans kmp 枚举
题目连接:点击查看题意:n个字符串最长公共子串,相同长度就找字典序小的,poj那个是长度小于3,输出那句话题解:以某一字符串为基准,枚举每个子串,然后暴力kmp即可,特记!!!不符合就break,否则会T掉HDU:#include<iostream>#include<cstdio>#include<algorithm>#include&l...原创 2019-02-27 20:36:13 · 146 阅读 · 0 评论 -
HDU - 3336 Count the string dp+kmp
题目链接:点击查看It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example...原创 2019-01-31 16:36:29 · 119 阅读 · 0 评论 -
POJ - 2752 Seek the Name, Seek the Fame next数组应用
题目链接:点击查看The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same t...原创 2019-01-31 16:14:48 · 95 阅读 · 0 评论 -
POJ - 2406 Power Strings next数组应用循环节
题目链接:点击查看 Language:Default Power Strings Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 61784 Accepted: 25534 Description Given tw...原创 2019-01-31 15:59:50 · 109 阅读 · 0 评论 -
HDU - 3746 Cyclic Nacklace next数组求 循环节
题目链接:点击查看CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking a...原创 2019-01-31 15:40:34 · 123 阅读 · 0 评论 -
HDU - 1358 Period kmp next数组求循环节
题目链接:点击查看For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for...原创 2019-01-31 15:20:32 · 161 阅读 · 0 评论 -
HDU - 5918 Sequence I
Mr. Frog has two sequences a1,a2,⋯,ana1,a2,⋯,an and b1,b2,⋯,bmb1,b2,⋯,bm and a number p. He wants to know the number of positions q such that sequence b1,b2,⋯,bmb1,b2,⋯,bm is exactly the sequence aq,a...原创 2018-09-10 12:44:11 · 298 阅读 · 0 评论