浣熊-CSDN博客

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

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

2014-12-04 11:16:32 111395 57

原创如何获取微信uin

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

2014-11-19 13:52:17 50223 14

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

1、向SD卡写数据，数据以文本文件（txt）的方式存储

2014-11-13 11:24:36 3936 2

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

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

2014-08-22 16:46:00 1921

转载 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 941

原创 iOS NSThread 初体验

iOS有三种多线程编程技术：（1）NSThread（2）NSOperation（3）GCD

2014-08-21 17:39:21 730 1

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

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

2014-07-08 14:25:21 3405 1

原创 iOS自定义UIButton

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

2014-07-02 16:18:38 6335

原创 iOS开发——全局响应MotionEvent

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

2014-06-26 20:50:20 5644

原创 [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 840

原创 [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 755

原创 [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 740

原创 [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 771

原创 [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 674

原创 [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 725

原创 [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 746

原创 [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 680

原创 [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 1408

原创 [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 657

原创 [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 648

原创 [LeetCode] Binary Tree Postorder Traversal [递归版]

题目：Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].Note: Recurs

2014-06-10 15:54:03 571

原创 [LeetCode] Permutations

题目：Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].解答：

2014-06-10 14:43:13 605

原创 [LeetCode] Plus One

题目：Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.解答

2014-06-08 16:41:39 1490

原创 [LeetCode] Rotate Image

题目：You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?解答：class Solution {public: void rotat

2014-06-08 15:30:43 621

原创 [LeetCode] Generate Parentheses

题目：Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))", "(()())", "(())()", "()(()

2014-06-07 16:32:08 635

原创 [LeetCode] Sort Colors

题目：Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the

2014-06-04 08:37:37 623

原创 [LeetCode] Symmetric Tree

题目：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3

2014-06-03 16:20:00 746

原创 [LeetCode] Gray Code

题目：The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the seque

2014-06-03 08:49:19 785

原创 [LeetCode] Remove Duplicates from Sorted Array

题目：Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in p

2014-05-24 16:53:44 482

原创 [LeetCode] Merge Sorted Array

题目：Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional eleme

2014-05-24 16:32:30 661

原创 [LeetCode] Swap Nodes in Pairs

题目：Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant

2014-05-24 14:35:03 1095

原创 [LeetCode] Pascal's Triangle

题目：解法：class Solution {public: vector> generate(int numRows) { vector> triangle; vector triangle_cell; if(numRows == 0) { return triangle; }

2014-05-24 14:13:12 672

原创 [LeetCode] Merge Two Sorted Lists

题目：Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

2014-05-24 13:49:31 835

原创 [LeetCode] Remove Element

题目：Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new len

2014-05-24 12:55:08 611

原创 [LeetCode] Maximum Subarray

题目：Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4,−

2014-05-24 11:22:14 746

原创 [LeetCode] Climbing Stairs

tiYou are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

2014-05-24 10:12:35 690

原创 [LeetCode] Remove Duplicates from Sorted List

题目：Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.解答：

2014-05-24 09:54:08 494

原创 [LeetCode] Search Insert Position

题目：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 in t

2014-05-23 10:07:14 552

原创 [LeetCode] Populating Next Right Pointers in Each Node

题目：Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next

2014-05-23 09:12:08 2970 3

原创 [LeetCode] Binary Tree Inorder Traversal [递归版]

题目：Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursiv

2014-05-23 08:10:17 651