<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/fhlkm</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; fhlkm]]></copyright><item><title><![CDATA[Android apk如何反root 手机安装？]]></title><link>https://blog.csdn.net/fhlkm/article/details/80133453</link><guid>https://blog.csdn.net/fhlkm/article/details/80133453</guid><author>fhlkm</author><pubDate>Wed, 27 Dec 2017 23:28:59 +0800</pubDate><description><![CDATA[我的apk已经在java中实现了root detect,但是apk 经过： 反编译-》修改smail-》编译，还可以绕过root detect. 
因为是发布在google play上，对于apk加壳是不允许的。 请问大家是如何root detect 的，有没有第三方的框架之类的？ ...]]></description><category></category></item><item><title><![CDATA[二维数组和指向指针的指针]]></title><link>https://blog.csdn.net/fhlkm/article/details/39790457</link><guid>https://blog.csdn.net/fhlkm/article/details/39790457</guid><author>fhlkm</author><pubDate>Sun, 05 Oct 2014 00:36:56 +0800</pubDate><description><![CDATA[转自
http://www.cnblogs.com/stoneJin/archive/2011/09/21/2184211.html]]></description><category></category></item><item><title><![CDATA[jni的调用]]></title><link>https://blog.csdn.net/fhlkm/article/details/14226637</link><guid>https://blog.csdn.net/fhlkm/article/details/14226637</guid><author>fhlkm</author><pubDate>Wed, 06 Nov 2013 14:09:48 +0800</pubDate><description><![CDATA[http://developer.android.com/tools/sdk/ndk/index.html
 可以直接跳过 
android update project -p . -s



直接调用

cd /samples/hello-jni
/ndk-build]]></description><category></category></item><item><title><![CDATA[数据结构考试重点回顾]]></title><link>https://blog.csdn.net/fhlkm/article/details/10288497</link><guid>https://blog.csdn.net/fhlkm/article/details/10288497</guid><author>fhlkm</author><pubDate>Sun, 25 Aug 2013 00:29:19 +0800</pubDate><description><![CDATA[1.      Go through 遍历
2.      circular
linked 
list 循环链表
3.      Stack first inlast out
4.      Queue first infirst out
5.      cirular queue
6.      Degree 树结点所拥有有子结点的个数
7.      Depth 树的深度，只有]]></description><category></category></item><item><title><![CDATA[java按值传递]]></title><link>https://blog.csdn.net/fhlkm/article/details/10132465</link><guid>https://blog.csdn.net/fhlkm/article/details/10132465</guid><author>fhlkm</author><pubDate>Wed, 21 Aug 2013 08:57:30 +0800</pubDate><description><![CDATA[package com.alogrithm.test2;

public class Refs  {
	   public static void main(String[] args)  {
	      MyPoint p1 = new MyPoint(10, 20);
	      MyPoint p2 = new MyPoint(30, 40);

	      System.out.pr]]></description><category></category></item><item><title><![CDATA[java 用数组写queue]]></title><link>https://blog.csdn.net/fhlkm/article/details/9914647</link><guid>https://blog.csdn.net/fhlkm/article/details/9914647</guid><author>fhlkm</author><pubDate>Mon, 12 Aug 2013 06:48:40 +0800</pubDate><description><![CDATA[package com.alogrithm.structure;

import java.util.NoSuchElementException;
/**
 * Make an Queue with group
 * @author Tim.Feng
 *
 * @param 
 */
public class ArrayQueue implements Cloneable {
	private]]></description><category></category></item><item><title><![CDATA[BubbleSort]]></title><link>https://blog.csdn.net/fhlkm/article/details/9345443</link><guid>https://blog.csdn.net/fhlkm/article/details/9345443</guid><author>fhlkm</author><pubDate>Tue, 16 Jul 2013 17:47:31 +0800</pubDate><description><![CDATA[ublic class BubbleSort {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		int[] a = {9,8,7,6,5,4,3,2,1};
		bubbleSort(a);
		/*for(int i =0;i<a.length;i++){
			System.out.println(]]></description><category></category></item><item><title><![CDATA[HeapSort]]></title><link>https://blog.csdn.net/fhlkm/article/details/9345251</link><guid>https://blog.csdn.net/fhlkm/article/details/9345251</guid><author>fhlkm</author><pubDate>Tue, 16 Jul 2013 17:30:20 +0800</pubDate><description><![CDATA[public class HeapSort {

        /**
         * @param args
         */
        public static void main(String[] args) {
                int [] test = {1,2,3,4,5,6,7,8,9};
                heapSort(tes]]></description><category></category></item><item><title><![CDATA[ShelllSort]]></title><link>https://blog.csdn.net/fhlkm/article/details/9345211</link><guid>https://blog.csdn.net/fhlkm/article/details/9345211</guid><author>fhlkm</author><pubDate>Tue, 16 Jul 2013 17:28:28 +0800</pubDate><description><![CDATA[public class ShelllSort {

        /**
         * @param args
         */
        public static void main(String[] args) {
                int [] data = {1,5,11,4,15,16,18};

                shellSort]]></description><category></category></item><item><title><![CDATA[binary search]]></title><link>https://blog.csdn.net/fhlkm/article/details/9164855</link><guid>https://blog.csdn.net/fhlkm/article/details/9164855</guid><author>fhlkm</author><pubDate>Mon, 24 Jun 2013 20:07:25 +0800</pubDate><description><![CDATA[二分查找又称折半查找，优点是比较次数少，查找速度快，平均性能好；其缺点是要求待查表为有序表，且插入删除困难。因此，折半查找方法适用于不经常变动而查找频繁的有序列表。首先，假设表中元素是按升序排列，将表中间位置记录的关键字与查找关键字比较，如果两者相等，则查找成功；否则利用中间位置记录将表分成前、后两个子表，如果中间位置记录的关键字大于查找关键字，则进一步查找前一子表，否则进一步查找后一子表。重复以]]></description><category></category></item><item><title><![CDATA[顺序查找 linear search]]></title><link>https://blog.csdn.net/fhlkm/article/details/9164851</link><guid>https://blog.csdn.net/fhlkm/article/details/9164851</guid><author>fhlkm</author><pubDate>Mon, 24 Jun 2013 20:05:00 +0800</pubDate><description><![CDATA[在一个已知无(或有序）序队列中找出与给定关键字相同的数的具体位置。原理是让关键字与队列中的数从第一个开始逐个比较，直到找出与给定关键字相同的数为止。
 
public class OrderSearch {
public static int ordersearch(int[] arry,int des){
int i=0;
for(;i<=arry.length-1;i++){
if(des]]></description><category></category></item><item><title><![CDATA[Java常见异常(Runtime Exception )小结]]></title><link>https://blog.csdn.net/fhlkm/article/details/9144547</link><guid>https://blog.csdn.net/fhlkm/article/details/9144547</guid><author>fhlkm</author><pubDate>Fri, 21 Jun 2013 13:21:35 +0800</pubDate><description><![CDATA[http://www.cnblogs.com/qinqinmeiren/archive/2010/10/14/2151702.html

本文重在Java中异常机制的一些概念。写本文的目的在于方便我很长时间后若是忘了这些东西可以通过这篇文章迅速回忆起来。 
1. 异常机制 
1.1 异常机制是指当程序出现错误后，程序如何处理。具体来说，异常机制提供了程序退出的安全通道。当出现错误后，程序执]]></description><category></category></item><item><title><![CDATA[快速排序]]></title><link>https://blog.csdn.net/fhlkm/article/details/9096225</link><guid>https://blog.csdn.net/fhlkm/article/details/9096225</guid><author>fhlkm</author><pubDate>Fri, 14 Jun 2013 16:47:05 +0800</pubDate><description><![CDATA[//  快速排序
 
package com.alogrithm;

public class QuickSort {
	public static void sort(Comparable[] data, int low, int high) {
		// 枢纽元，一般以第一个元素为基准进行划分
		Comparable pivotKey = data[low];
		int i = low]]></description><category></category></item><item><title><![CDATA[归并排序]]></title><link>https://blog.csdn.net/fhlkm/article/details/9095211</link><guid>https://blog.csdn.net/fhlkm/article/details/9095211</guid><author>fhlkm</author><pubDate>Fri, 14 Jun 2013 15:28:30 +0800</pubDate><description><![CDATA[/****归并排序吧数组拆成单个，然后在进行排序合并*/ public class MergeSortClass {
	private int[] SortOut;

	public void printSortedOutput() {
		for (int i = 0; i < this.SortOut.length; i++) {
			System.out.print(this.SortOu]]></description><category></category></item><item><title><![CDATA[常用计算机工具收藏]]></title><link>https://blog.csdn.net/fhlkm/article/details/9030689</link><guid>https://blog.csdn.net/fhlkm/article/details/9030689</guid><author>fhlkm</author><pubDate>Wed, 05 Jun 2013 14:38:47 +0800</pubDate><description><![CDATA[1 Agent Ransack
一款强大的文件搜索软件，不但能够搜索文件名，还能够搜索文件中的信息]]></description><category></category></item><item><title><![CDATA[struts代码]]></title><link>https://blog.csdn.net/fhlkm/article/details/8950185</link><guid>https://blog.csdn.net/fhlkm/article/details/8950185</guid><author>fhlkm</author><pubDate>Mon, 20 May 2013 14:04:08 +0800</pubDate><description><![CDATA[HelloWorld
    /example
        

 -------------------------------------------------------
urlTag调用 action,调用了hello.action

<%@ page language="java" contentType="text/html; charset=ISO-8859-1"]]></description><category></category></item><item><title><![CDATA[JavaScript中With 语句使用方法实例]]></title><link>https://blog.csdn.net/fhlkm/article/details/8834177</link><guid>https://blog.csdn.net/fhlkm/article/details/8834177</guid><author>fhlkm</author><pubDate>Mon, 22 Apr 2013 13:54:56 +0800</pubDate><description><![CDATA[有了 With 语句，在存取对象属性和方法时就不用重复指定参考对象，在 With 语句块中，凡是 JavaScript 不识别的属性和方法都和该语句块指定的对象有关。With 语句的语法格式如下所示：
      With Object {
      Statements
      }
      对象指明了当语句组中对象缺省时的参考对象，这里我们用较为熟悉的 Document 对象对]]></description><category></category></item><item><title><![CDATA[oneway in aidl]]></title><link>https://blog.csdn.net/fhlkm/article/details/8718364</link><guid>https://blog.csdn.net/fhlkm/article/details/8718364</guid><author>fhlkm</author><pubDate>Mon, 25 Mar 2013 18:34:52 +0800</pubDate><description><![CDATA[The oneway keyword means that if that call results in an IPC (i.e. the caller and callee are in different processes) then the calling process will not wait for the called process to handle the IPC. If]]></description><category></category></item><item><title><![CDATA[eclipse开发c/C++]]></title><link>https://blog.csdn.net/fhlkm/article/details/8717847</link><guid>https://blog.csdn.net/fhlkm/article/details/8717847</guid><author>fhlkm</author><pubDate>Mon, 25 Mar 2013 16:46:51 +0800</pubDate><description><![CDATA[http://www.cnblogs.com/feisky/archive/2010/03/21/1691170.html
http://www.iteye.com/topic/560534
安装完毕，需要将MinWGW的bin加入到系统变量，并将 mingw32-make.exe改名为make.exe]]></description><category></category></item><item><title><![CDATA[android自定义Spinner]]></title><link>https://blog.csdn.net/fhlkm/article/details/8716880</link><guid>https://blog.csdn.net/fhlkm/article/details/8716880</guid><author>fhlkm</author><pubDate>Mon, 25 Mar 2013 14:14:43 +0800</pubDate><description><![CDATA[自定义的Spinner以下拉列表的形式出现]]></description><category></category></item></channel></rss>