浣熊_BUPT

移动互联网...智能终端开发...

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

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

2014-12-04 11:16:32

阅读数 97474

评论数 76

如何获取微信uin

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

2014-11-19 13:52:17

阅读数 40660

评论数 17

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

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

2014-11-13 11:24:36

阅读数 3662

评论数 2

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

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

2014-08-22 16:46:00

阅读数 1531

评论数 0

iOS GCD

from:http://www.dreamingwish.com/dream-category/toturial/gcd-guide GCD介绍(一): 基本概念和Dispatch Queue 什么是GCD? Grand Central Dispatch或者GCD,是一套低层AP...

2014-08-22 14:40:42

阅读数 711

评论数 0

iOS NSThread 初体验

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

2014-08-21 17:39:21

阅读数 591

评论数 1

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

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

2014-07-08 14:25:21

阅读数 3187

评论数 1

iOS自定义UIButton

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

2014-07-02 16:18:38

阅读数 6205

评论数 0

iOS开发——全局响应MotionEvent

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

2014-06-26 20:50:20

阅读数 5211

评论数 0

[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 pa...

2014-06-17 22:22:40

阅读数 730

评论数 0

[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 ...

2014-06-16 10:39:23

阅读数 666

评论数 0

[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...

2014-06-16 09:46:19

阅读数 651

评论数 0

[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 w...

2014-06-15 11:22:55

阅读数 666

评论数 0

[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 gi...

2014-06-15 10:53:43

阅读数 571

评论数 0

[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...

2014-06-15 09:24:47

阅读数 620

评论数 0

[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 usin...

2014-06-14 16:05:54

阅读数 618

评论数 0

[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 ...

2014-06-14 14:35:30

阅读数 583

评论数 0

[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 on...

2014-06-14 08:59:01

阅读数 1293

评论数 0

[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 a...

2014-06-12 23:30:50

阅读数 536

评论数 0

[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...

2014-06-10 18:30:39

阅读数 570

评论数 0

提示
确定要删除当前文章?
取消 删除
关闭
关闭