<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[初吻--给了奶嘴]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/su869__</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; su869__]]></copyright><item><title><![CDATA[Mac系统快速上手教学]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/117034419</link><guid>https://blog.youkuaiyun.com/su869__/article/details/117034419</guid><author>su869__</author><pubDate>Mon, 24 May 2021 15:41:41 +0800</pubDate><description><![CDATA[一、触摸板常用操作





二、常用快捷键



文件操作
全选： Command + A

复制： Command + C

粘贴： Command + V

回退： Command + Z

保存： Command + S

剪切： Command + X

将文件移至废纸篓： Command + Delete



其他
查找：                  Command + F

截取全部屏幕：          Comman...]]></description><category></category></item><item><title><![CDATA[android清理安全app测试经验总结]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/117223817</link><guid>https://blog.youkuaiyun.com/su869__/article/details/117223817</guid><author>su869__</author><pubDate>Mon, 24 May 2021 15:05:25 +0800</pubDate><description><![CDATA[一、需求评审

认真了解需求，尽可能在此阶段找出隐藏需求同步给dev，减少后续工作量；
	尽可能指出prd中有误以及功能交互存在不合理的地方，以减少测试过程中折返跑；
	站在用户角度分析需求，如果存在不合理地方，提出来和大家讨论；
	大致构想下如何开展测试，是否存在人力、硬件设备不足的情况以及测试技术达不到的情况，提出来和大家讨论解决方案。
二、用例

1.往往是新功能和改动较大需求时编写，优化和平移一般情况下不写用例；

2.尽可能在需求评审后不久内完成用例编写，减少重复了解需求的工作量；

3.除了常规]]></description><category></category></item><item><title><![CDATA[python实现android应用稳定性测试]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/116715697</link><guid>https://blog.youkuaiyun.com/su869__/article/details/116715697</guid><author>su869__</author><pubDate>Wed, 12 May 2021 17:43:49 +0800</pubDate><description><![CDATA[一、作用

长时间操作app是否会出现崩溃和anr现象，发现人无法感知的crash

二、实现原理

使用python模拟终端输入monkey命令，同时抓取ERROR级别及以上的logcat日志，最后通过数据处理判定是否测试通过（结果含有"Monkey finished"结果为pass、含有
“System appears to have crashed"结果为false）并筛选monkey日志中的crash和anr数量

三、环境

python + monkey

四、代码（根据自身需求更改第60行的m]]></description><category></category></item><item><title><![CDATA[python实现测试android应用冷启动]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/116714205</link><guid>https://blog.youkuaiyun.com/su869__/article/details/116714205</guid><author>su869__</author><pubDate>Wed, 12 May 2021 17:14:21 +0800</pubDate><description><![CDATA[一、实现原理

通过adb获取到想要测试页面的activity，通过adb命令（adb shell am force-stop 包名）退出app、再使用（adb shell am start -W activity名称）命令启动app到指定页面并获取每次冷启动数值（单位：ms），重复10次退出和开启获取到10个数值，每次获取到数值存入列表，最后排序并去除最大值和最小值取8个值的平均数（降低偶然性）。

二、环境

python3 + adb

三、代码


# coding:utf-8

import os]]></description><category></category></item><item><title><![CDATA[Python获取android设备cpu和内存占用情况]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/109646582</link><guid>https://blog.youkuaiyun.com/su869__/article/details/109646582</guid><author>su869__</author><pubDate>Thu, 12 Nov 2020 16:32:58 +0800</pubDate><description><![CDATA[功能：获取android设备中某一个app的cpu和内存
	环境：python和adb
	使用方法：使用adb连接android设备，打开将要测试的app，执行cpu/内存代码
	cpu获取代码如下：（输入参数为脚本执行时间）
	
# coding:utf-8
'''
获取系统total cpu
'''
import os, csv
import time
import csv
import numpy as np
from matplotlib import pyplot as plt

cpu_list]]></description><category></category></item><item><title><![CDATA[N皇后问题 HDU - 2553]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/77214796</link><guid>https://blog.youkuaiyun.com/su869__/article/details/77214796</guid><author>su869__</author><pubDate>Wed, 16 Aug 2017 09:27:10 +0800</pubDate><description><![CDATA[N皇后问题
 HDU
 - 2553 
在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。 
你的任务是，对于给定的N，求出有多少种合法的放置方法。 



Input共有若干行，每行一个正整数N≤10，表示棋盘和皇后的数量；如果N=0，表示结束。
Output共有若干行，每行一个正整数，表示对应]]></description><category></category></item><item><title><![CDATA[Sudoku POJ - 2676（数独）]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/77213840</link><guid>https://blog.youkuaiyun.com/su869__/article/details/77213840</guid><author>su869__</author><pubDate>Wed, 16 Aug 2017 09:23:22 +0800</pubDate><description><![CDATA[Sudoku
 POJ
 - 2676
Sudoku is a very simple task. A
 square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal dig]]></description><category></category></item><item><title><![CDATA[1160 蛇形矩阵]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/77153277</link><guid>https://blog.youkuaiyun.com/su869__/article/details/77153277</guid><author>su869__</author><pubDate>Mon, 14 Aug 2017 09:38:56 +0800</pubDate><description><![CDATA[1160 蛇形矩阵



题目描述 Description

小明玩一个数字游戏，取个n行n列数字矩阵（其中n为不超过100的奇数），数字的填补方法为：在矩阵中心从1开始以逆时针方向绕行，逐圈扩大，直到n行n列填满数字，请输出该n行n列正方形矩阵以及其的对角线数字之和.




输入描述 Input Description

n（即n行n列）




输出描述 ]]></description><category></category></item><item><title><![CDATA[The order of a Tree HDU - 3999]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/77093668</link><guid>https://blog.youkuaiyun.com/su869__/article/details/77093668</guid><author>su869__</author><pubDate>Fri, 11 Aug 2017 11:09:42 +0800</pubDate><description><![CDATA[The order of a Tree
 HDU
 - 3999 
As we know,the shape of a binary search tree is greatly related
 to the order of keys we insert. To be precisely: 
1.  insert a key k to a empty tree, then the t]]></description><category></category></item><item><title><![CDATA[Binary Tree Traversals HDU - 1710 （二叉树求后序）]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/77089574</link><guid>https://blog.youkuaiyun.com/su869__/article/details/77089574</guid><author>su869__</author><pubDate>Fri, 11 Aug 2017 10:12:01 +0800</pubDate><description><![CDATA[Binary Tree Traversals
 HDU
 - 1710 
A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the left and right subtrees. There a]]></description><category></category></item><item><title><![CDATA[Genealogical tree POJ - 2367（拓扑模板）]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/76603672</link><guid>https://blog.youkuaiyun.com/su869__/article/details/76603672</guid><author>su869__</author><pubDate>Thu, 03 Aug 2017 09:24:32 +0800</pubDate><description><![CDATA[Genealogic

al tree

 POJ
 - 2367


The system of Martians' blood relations is confusing enough. Actually, Martians bud when they want and where they want. They gather together in different gr]]></description><category></category></item><item><title><![CDATA[Wooden Sticks HDU - 1051 （贪心）]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/76222004</link><guid>https://blog.youkuaiyun.com/su869__/article/details/76222004</guid><author>su869__</author><pubDate>Thu, 27 Jul 2017 21:22:57 +0800</pubDate><description><![CDATA[Wooden Sticks
 HDU
 -1051 
There is a pile of n wooden sticks.
 The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fash]]></description><category></category></item><item><title><![CDATA[昂贵的聘礼 POJ - 1062 （Dijkstra）]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/76095746</link><guid>https://blog.youkuaiyun.com/su869__/article/details/76095746</guid><author>su869__</author><pubDate>Tue, 25 Jul 2017 19:16:31 +0800</pubDate><description><![CDATA[昂贵的聘礼
 POJ
 - 1062
年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长说："嗯，如果你能够替我弄到大祭司的皮袄，我可以只要8000金币。如果你能够弄来他的水晶球，那么只要5000金币就行了。"探险家就跑到大祭司那里，向他要求皮袄或水晶球，大]]></description><category></category></item><item><title><![CDATA[Meteor Shower POJ - 3669]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/75634723</link><guid>https://blog.youkuaiyun.com/su869__/article/details/75634723</guid><author>su869__</author><pubDate>Fri, 21 Jul 2017 11:15:55 +0800</pubDate><description><![CDATA[Meteor Sh

ower

 POJ
 - 3669 

Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will
 crash into earth and destroy anything they hit. Anxious for her]]></description><category></category></item><item><title><![CDATA[Five-In-a-Row CodeForces - 825B]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/75575156</link><guid>https://blog.youkuaiyun.com/su869__/article/details/75575156</guid><author>su869__</author><pubDate>Thu, 20 Jul 2017 19:17:12 +0800</pubDate><description><![CDATA[Five-In-a-Row
 CodeForces
 - 82
Alice and Bob play 5-in-a-row game. They have a playing field of size 10 × 10. In turns they put either crosses or noughts, one at a time. Alice puts crosses and Bob]]></description><category></category></item><item><title><![CDATA[find the most comfortable road HDU - 1598 （并查集）]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/75531190</link><guid>https://blog.youkuaiyun.com/su869__/article/details/75531190</guid><author>su869__</author><pubDate>Thu, 20 Jul 2017 15:48:24 +0800</pubDate><description><![CDATA[find the most comfortable road  HDU
 - 1598


 

XX星有许多城市，城市之间通过一种奇怪的高速公路SARS(Super
 Air Roam Structure---超级空中漫游结构）进行交流，每条SARS都对行驶在上面的Flycar限制了固定的Speed，同时XX星人对 Flycar的“舒适度”有特殊要求，即乘坐过程中最高速度与最低速度]]></description><category></category></item><item><title><![CDATA[C语言：小希的迷宫 HDU - 1272 （并查集——检验是否有回路）]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/75501189</link><guid>https://blog.youkuaiyun.com/su869__/article/details/75501189</guid><author>su869__</author><pubDate>Thu, 20 Jul 2017 11:12:48 +0800</pubDate><description><![CDATA[小希的迷宫HDU
 - 1272




上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走]]></description><category></category></item><item><title><![CDATA[Highways --（Kruskal和prim）C - Highways POJ - 1751]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/75472872</link><guid>https://blog.youkuaiyun.com/su869__/article/details/75472872</guid><author>su869__</author><pubDate>Thu, 20 Jul 2017 10:22:28 +0800</pubDate><description><![CDATA[Highways
 POJ
 - 1751 



The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem an]]></description><category></category></item><item><title><![CDATA[Find The Multiple ——深搜POJ - 1426]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/75461813</link><guid>https://blog.youkuaiyun.com/su869__/article/details/75461813</guid><author>su869__</author><pubDate>Thu, 20 Jul 2017 09:56:22 +0800</pubDate><description><![CDATA[Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there]]></description><category></category></item><item><title><![CDATA[叠框]]></title><link>https://blog.youkuaiyun.com/su869__/article/details/71155796</link><guid>https://blog.youkuaiyun.com/su869__/article/details/71155796</guid><author>su869__</author><pubDate>Wed, 03 May 2017 21:52:22 +0800</pubDate><description><![CDATA[需要的时候，就把一个个大小差一圈的筐叠上去，使得从上往下看时，边筐花色交错。这个工作现在要让计算机来完成，得看你的了。

Input输入是一个个的三元组，分别是，外筐尺寸n（n为满足0
Output输出叠在一起的筐图案，中心花色与外筐花色字符从内层起交错相叠，多筐相叠时，最外筐的角总是被打磨掉。叠筐与叠筐之间应有一行间隔。
Sample Input
11 B A
5 @ W

Sam]]></description><category></category></item></channel></rss>