- 博客(39)
- 收藏
- 关注
原创 软件测试中的测试左移和测试右移策略的概念
测试左移指的是将测试活动尽早引入到软件开发生命周期的早期阶段,即“向左”移动。传统的软件开发模式中,测试通常是在开发阶段结束后进行的,但测试左移强调在就开始测试。其目的是及早发现和修复缺陷,从而减少修复成本和时间。
2024-07-16 16:41:25 334
原创 App里的四种弹窗专业英文术语表达
作为一名测试人员,在写Bug描述的时候,通常需要精准的用词来表达问题所发生的场景,位置。本篇针对App里的弹窗总结了四种弹窗类型。在应用程序(App)中,常见的弹窗类型及其专业术语包括:Toast、Dialog、Actionbar 和 Snackbar。
2024-07-11 14:11:54 972
原创 App UI性能测试 - PerfDog使用全教程
通过USB连接好手机后,在Perfdog客户端选择上该手机,此时手机端会提示安装perfdog,根据提示一步步安装即可。第三步,选择app应用列表,配置要监控的数据,开始记录数据,杀掉手机多余进程,开始操作对应app。第四步,停止记录数据(不能少于10s),上传记录数据,进入perfdog后台查看性能数据。使用USB将手机和电脑连接,不能锁屏,开启调试模式。响应、内存、CPU、FPS、GPU渲染、耗电、耗流等。
2024-07-08 16:08:54 574
原创 MAC系统下Xcode连接iOS真机实现iOS App自动化测试(上)
通过Xcode打开appium下的 Contents/Resources/app/node_modules/appium-webdriveragent下scode.project 项目。安装xcuitest-driver(xcuitest也是基于webdriveragent)这将弹出一个对话框,提示您安装命令行工具。点击“安装”,然后等待安装完成。安装appium doctor并执行检查, 若无明显报错即安装成功。安装Xcode, 需选择与你MAC系统兼容的Xcode版本。的路径,则说明安装成功。
2024-06-12 17:48:59 763 1
原创 App测试要点
2.查看页面布局,手机设置中有一个开发者选项,开启显示布局边界,进入另一个app查看布局的界面,都是原生的话可以看到各个控件的布局,H5是整个页面的一个边界。6.功能增强方面,失败截图,失败重试,多进程,线程执行等,unitest需自定义和二次开发,pytest有对应插件或hook函数直接使用。如:清除手机内存再打开该应用。②根据basepage基类实现对象层,封装登陆页面的元素定位,封装定位用户名,密码,确认按钮的定位方式。3.长按界面,如果出现特殊标记,放大镜,复制,粘贴等,就表示是H5。
2023-08-23 14:22:01 150
原创 安卓App里有webview的元素定位方法
目前主要流行用Appium去定位App的元素以实现App自动化,但如果App里含有嵌入的webview页面的话,元素没有办法通过Appium定位到,下面介绍的一种方法可以解决这个问题。点击inspect就可以打开webview页面去定位元素了。打开手机上需要定位的webview,这时页面会刷新出来。2. 打开chrome浏览器输入。手机连接成功的话会显示在页面上。1. 将手机连上电脑。
2023-06-14 17:54:40 573
原创 用python脚本完成chromedriver的版本自动升级
很多时候chrome浏览器会自动升级,chromedriver的版本号与chrome浏览器版本不匹配时在运行程序时就会报错用下面的脚本可以自动安装chromedriver的最新版本到指定路径
2023-03-15 11:24:29 1498
原创 The Solution to Leetcode 463 Island Perimeter
Question: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
2017-06-28 18:17:38 194
原创 [DFS] leetcode 104. Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node./** * Definition for a bina
2017-06-26 20:50:24 261
原创 [DFS] leetcode 100. Same Tree
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value./** * Def
2017-06-26 20:24:30 207
原创 [sicily] 1002. 等价二叉树
Time Limit: 1sec Memory Limit:256MB Description两个二叉树结构相同,且对应结点的值相同,我们称这两个二叉树等价. 例如:以下两个二叉树等价 1 1 / \ / \ 2 3 2 3而以下两个则不等价
2017-06-23 20:15:03 203
原创 [sicily]1001 会议安排
Time Limit: 1sec Memory Limit:256MB DescriptionN个会议要同时举行,参会人数分别为A[0], A[1], ..., A[N-1]. 现有M个会议室,会议室可容纳人数分别为B[0], B[1], ..., B[M-1]. 当A[i] 1 请为下面的Solution类实现解决上述问题的函数assignConferen
2017-06-23 19:24:13 215
原创 [sicily]1000. 函数求值
Time Limit: 1sec Memory Limit:256MB Description定义超级和函数F如下:F(0, n) = n,对于所有的正整数n..F(k, n) = F(k – 1, 1) + F(k – 1, 2) + … + F(k – 1, n),对于所有的正整数k和n. 请实现下面Solution类中计算F(k, n)的函数(1
2017-06-23 15:17:32 241
原创 8.12证明
8.12 k-生成树问题:输入:无向图G=(V, E) 输出:G的一个生成树,其中所有的节点度数都不超过k——如果该树存在。 请证明对任意k>=2: (a)k-生成树问题是一个搜索问题。 (b)k-生成树问题是NP-完全的。(提示:由k=2开始,考虑该问题与Rudrata路径问题的关联。)证明如下:(a) 因为k-生成树问题能够在多项式时间内验证,所以是一个搜索问题
2017-06-22 11:07:55 246
原创 The Solution to Leetcode 605 Can Place Flowers
Question:Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both w
2017-06-20 20:23:05 339
原创 The Solution to Leetcode 268 Missing Number
Question:Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1, 3] return 2.思路:先将所给的数组进行从小
2017-06-20 16:52:54 295
原创 The Solution to Leetcode 617 Merge Two Binary Trees
Question:Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into
2017-06-13 17:26:51 1031
原创 The Solution to Leetcode 101 Symmetric Tree
Question:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \
2017-06-09 14:59:36 253
原创 The Solution to Leetcode 563 Binary Tree Tilt
Question:Given a binary tree, return the tilt of the whole tree.The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of a
2017-06-05 10:19:57 252
原创 The Solution to Leetcode 110 Balanced Binary Tree
Question:Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every n
2017-05-31 15:56:17 231
原创 The Solution to Leetcode 119 Pascal's Triangle II
Question:Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].思路:元素之间满足这样的一个关系:a[i][j]=a[i-1][j-1]+a[i-1][j],除了每一行的第一个数和最后一个数都是1以外。由于要使
2017-05-31 15:45:58 280
原创 The Solution to Leetcode 118 Pascal's Triangle
Question:Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]思路:由上述例子可以看出,
2017-05-17 17:21:20 215
原创 The Solution to Leetcode 55 Jump Game
Question:Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.
2017-05-11 10:10:04 169
原创 The Solution to Leetcode 541 Reverse String II
Question:Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, revers
2017-04-23 18:54:15 169
原创 The Solution to Leetcode 344 Reverse String
Question:Write a function that takes a string as input and returns the string reversed.Example:Given s = "hello", return "olleh".思路:将字符串首末字符调换,第二个字符与倒数第二个字符调换,以此类推。Answer:class Sol
2017-04-12 10:51:49 306
原创 The Solution to Leetcode 137 Single Number II
Question:Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one.Note:Your algorithm should have a linear runtime com
2017-04-06 09:58:39 196
原创 The Solution to Leetcode 136 Single Number
Question:Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it wi
2017-04-06 09:15:36 202
原创 The Solution to Leetcode 520 Detect Capital
Question:Given a word, you need to judge whether the usage of capitals in it is right or not.We define the usage of capitals in a word to be right when one of the following cases holds:A
2017-03-28 16:26:06 192
原创 The Solution to Leetcode 35 Search Insert Position
Question:Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates
2017-03-25 19:14:19 168
原创 The Solution to LeetCode 111 Minimum Depth of Binary Tree
Question:Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.给一个二叉树,求最小深度。1.根节
2017-03-16 16:45:39 192
原创 The Solution to LeetCode 15 3Sum改进版
Question:Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set m
2017-03-10 11:26:52 219
原创 The Solution to LeetCode 15 3Sum
Question:Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set m
2017-03-09 16:57:24 178
原创 The Solution to LeetCode 69 Sqrt(x)
Question:Implement int sqrt(int x).Compute and return the square root of x.思路:本题采用二分法进行求解。Answer:class Solution {public: int mySqrt(int x) { int low=0; int high=x;
2017-03-02 17:39:56 203
原创 The Solution to LeetCode 147 Insertion Sort List
Question:Sort a linked list using insertion sort.Answer://本题我的解法是直接插入排序。/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListN
2017-02-26 17:50:45 177
原创 The Solution to LeetCode 120 Triangle
Question:Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2],
2017-02-23 09:50:48 163
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人