10 浣熊

尚未进行身份认证

北京邮电大学计算机学院 嵌入式系统与网络通信实验室 iOS/Android应用开发

等级
TA的排名 7k+

直接利用Android手机破解微信加密数据库EnMicroMsg.db

※首先,简单介绍一下微信加密数据库EnMicroMsg.db的破解方法:要先批评一下微信,居然用开源的数据库加密方式,这不是一破解一个准吗...如果你的模拟器或者真机已经获得了root权限,就可以直接将记录聊天记录的数据库文件拷贝出来,数据库文件具体存放位置如下:在/data/data/中:(题外话:android原生的模拟器root起来很复杂,推荐一款第三方模拟器:gen

2014-12-04 11:16:32

如何获取微信uin

首先解释什么是微信的“uin”:uin就是userinformation,也就是te'd

2014-11-19 13:52:17

PhoneGap读写SD卡——文本文件方式

1、向SD卡写数据,数据以文本文件(txt)的方式存储

2014-11-13 11:24:36

形象解释“同步”、“异步”、“并发”的区别

只是形象的解释,不深入zhan'kai

2014-08-22 16:46:00

iOS GCD

from:http://www.dreamingwish.com/dream-category/toturial/gcd-guideGCD介绍(一): 基本概念和Dispatch Queue什么是GCD?Grand Central Dispatch或者GCD,是一套低层API,提供了一种新的方法来进行并发程序编写。从基本功能上讲,GCD有点像NSOperationQueue

2014-08-22 14:40:42

iOS NSThread 初体验

iOS有三种多线程编程技术:(1)NSThread(2)NSOperation(3)GCD

2014-08-21 17:39:21

iOS开发 Objective-C assign、retain、copy区别

这三个关键字在用@property生命属性时使用,

2014-07-08 14:25:21

iOS自定义UIButton

MyUIButton.h#import @interface MyUIButton : UIButton@property (nonatomic, assign) BOOL isPressed;- (void)setIsPressed:(BOOL)isPressed;@endMyUIButton

2014-07-02 16:18:38

iOS开发——全局响应MotionEvent

遇到这样一个需求:应用无论处于哪个view controller,摇动手机,都能够出发某一方法。能够想到的思路就是用苹果封装好的“MotionEvent”,但是如果简单的把一下代码加到某一view controller中,那么只有在该view controller展示在前端时,摇动手机才会出发方法。- (BOOL)canBecomeFirstResponder {//默认是NO,所以得重写

2014-06-26 20:50:20

[LeetCode] Sum Root to Leaf Numbers

题目:Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find

2014-06-17 22:22:40

[LeetCode] Minimum Depth of Binary Tree

题目: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.

2014-06-16 10:39:23

[LeetCode] Remove Duplicates from Sorted Array II

题目:Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array A = [1,1,1,2,2,3],Your function should return length = 5, and A is no

2014-06-16 09:46:19

[LeetCode] Balanced Binary Tree

题目: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 node ne

2014-06-15 11:22:55

[LeetCode] Path Sum

题目:Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree

2014-06-15 10:53:43

[LeetCode] Container With Most Water

题目:Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i,

2014-06-15 09:24:47

[LeetCode] Linked List Cycle II

题目:Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?解答:

2014-06-14 16:05:54

[LeetCode] Minimum Path Sum

题目:Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or

2014-06-14 14:35:30

[LeetCode] Best Time to Buy and Sell Stock

题目:Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of th

2014-06-14 08:59:01

[LeetCode] Unique Paths

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the

2014-06-12 23:30:50

[LeetCode] Search a 2D Matrix

题目:Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first intege

2014-06-10 18:30:39

查看更多

勋章 我的勋章
    暂无奖章