<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[cfanr]]></title><description><![CDATA[对贡献有激情，对回报有信心！]]></description><link>https://blog.youkuaiyun.com/Mars_NAVY</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Mars_NAVY]]></copyright><item><title><![CDATA[Android NDK 开发：CMake 使用]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/77604379</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/77604379</guid><author>Mars_NAVY</author><pubDate>Sat, 26 Aug 2017 17:46:12 +0800</pubDate><description><![CDATA[1. 前言当在做 Android NDK 开发时，如果不熟悉用 CMake 来构建，读不懂 CMakeLists.txt 的配置脚本，很容易就会踩坑，遇到编译失败，一个很小的配置问题都会浪费很多时间。所谓工欲善其事必先利其器，学习 NDK 开发还是要大致了解 CMake 的基本语法和配置的。下面文章是根据 CMake 实践手册 做的一些简短笔记，具体说得不够详细的地方，可以查看手册。2. CMake]]></description><category></category></item><item><title><![CDATA[Android NDK 开发：实战案例]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/77407350</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/77407350</guid><author>Mars_NAVY</author><pubDate>Sat, 19 Aug 2017 10:58:56 +0800</pubDate><description><![CDATA[0. 前言如果只学理论，不做实践，不踩踩坑，一般很难发现真正实践项目中的问题的，也比较难以加深对技术的理解。所以延续上篇 JNI 的实战Android NDK开发：JNI实战篇 ，这篇主要是一些 NDK 小项目的练习，由于这些项目网上都有 demo介绍，这里不会具体一步步介绍如何操作，只记录一些个人需要注意的地方或一些主要步骤，详细的介绍或代码可以点击里面的链接查看。1. 文件加解密和分割合并1.1]]></description><category></category></item><item><title><![CDATA[微信 Mars Android Sample 源码分析]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/77104218</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/77104218</guid><author>Mars_NAVY</author><pubDate>Fri, 11 Aug 2017 23:16:42 +0800</pubDate><description><![CDATA[注：原文首发地址零、前言Mars 是微信官方开源的跨平台跨业务的终端基础组件，具有高质量网络连接模块(长短连接、智能心跳机制)、高性能日志模块和网络监测组件等。而整个 Android Sample 是基于 Mars 开发的一个 demo，包含提供了以下功能：
基于TCP长连接的聊天室体验。
数据通信成功率、耗时、流量的展示。
网络状况检测结果展示。
一、本地运行 Server 端具体如何运行 Ser]]></description><category></category></item><item><title><![CDATA[Android NDK开发：JNI实战篇]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/76739560</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/76739560</guid><author>Mars_NAVY</author><pubDate>Sun, 06 Aug 2017 09:08:15 +0800</pubDate><description><![CDATA[注：首发地址紧接上篇：Android NDK开发：JNI基础篇 | cfanr，这篇主要介绍 JNI Native 层调用Java 层的代码（涉及JNI 数据类型映射和描述符的使用）和如何动态注册 JNI。 1. Hello World NDK在开始实战练习前，你需要先大致了解运行一个 Hello World 的项目大概需要做什么，有哪些配置以及配置的具体意思。 Android Studio(2.2]]></description><category></category></item><item><title><![CDATA[Android NDK开发：JNI基础篇]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/76706235</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/76706235</guid><author>Mars_NAVY</author><pubDate>Sat, 05 Aug 2017 10:20:51 +0800</pubDate><description><![CDATA[Android NDK开发：JNI基础篇
JNI 概念
1.1 概念JNI 全称 Java Native Interface，Java 本地化接口，可以通过 JNI 调用系统提供的 API。操作系统，无论是 Linux，Windows 还是 Mac OS，或者一些汇编语言写的底层硬件驱动都是 C/C++ 写的。Java和C/C++不同 ，它不会直接编译成平台机器码，而是编译成虚拟机可以运行的Java]]></description><category></category></item><item><title><![CDATA[【Effective Java】创建和销毁对象]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/43409699</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/43409699</guid><author>Mars_NAVY</author><pubDate>Mon, 02 Feb 2015 16:04:17 +0800</pubDate><description><![CDATA[一、考虑用静态工厂方法代替构造器


构造器是创建一个对象实例的最基本最常用的方法。开发者在使用某个类的时候，通常会使用new一个构造器来实现，其实也有其他方式可以实现的，如利用发射机制。这里主要说的是通过静态类工厂的方式来创建class的实例，如：


public static Boolean valueOf(boolean b) {    return b ? Boolean.T]]></description><category></category></item><item><title><![CDATA[Cracking the coding interview汇总目录]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42175305</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42175305</guid><author>Mars_NAVY</author><pubDate>Fri, 26 Dec 2014 20:07:34 +0800</pubDate><description><![CDATA[很久之前刷的CTCI的题目，都快忘记了，做个分类汇总，再重新好好复习一遍。


Chapter 1 | Arrays and Strings
1.1 Implement an algorithm to determine if a string has all unique characters. What if you can not use additional
 data stru]]></description><category></category></item><item><title><![CDATA[【LeetCode】Path Sum II]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42126137</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42126137</guid><author>Mars_NAVY</author><pubDate>Wed, 24 Dec 2014 17:20:13 +0800</pubDate><description><![CDATA[题目


Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.
For example:
Given the below binary tree and sum = 22,
              5
             / ]]></description><category></category></item><item><title><![CDATA[【LeetCode】Sum Root to Leaf Numbers]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42103101</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42103101</guid><author>Mars_NAVY</author><pubDate>Tue, 23 Dec 2014 15:27:19 +0800</pubDate><description><![CDATA[题目


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 th]]></description><category></category></item><item><title><![CDATA[【LeetCode】Same Tree]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42061227</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42061227</guid><author>Mars_NAVY</author><pubDate>Sun, 21 Dec 2014 16:31:06 +0800</pubDate><description><![CDATA[题目


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.
解答
]]></description><category></category></item><item><title><![CDATA[【LeetCode】Binary Tree Inorder Traversal]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42060517</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42060517</guid><author>Mars_NAVY</author><pubDate>Sun, 21 Dec 2014 15:00:21 +0800</pubDate><description><![CDATA[题目


Given a binary tree, return the inorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3




return [1,3,2].
解答
中序遍历二叉树。
递归法]]></description><category></category></item><item><title><![CDATA[【LeetCode】Minimum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42042993</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42042993</guid><author>Mars_NAVY</author><pubDate>Sat, 20 Dec 2014 15:36:45 +0800</pubDate><description><![CDATA[题目


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.
解答
求树的最小深度。类似Maximum Depth]]></description><category></category></item><item><title><![CDATA[【LeetCode】Maximum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42042665</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42042665</guid><author>Mars_NAVY</author><pubDate>Sat, 20 Dec 2014 14:47:47 +0800</pubDate><description><![CDATA[题目


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.
解答
求二叉树的最大深度。
递归：a.若二叉树为空，]]></description><category></category></item><item><title><![CDATA[【LeetCode】Binary Tree Level Order Traversal II]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42029149</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42029149</guid><author>Mars_NAVY</author><pubDate>Fri, 19 Dec 2014 16:34:53 +0800</pubDate><description><![CDATA[题目


Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree {3,9,20,#,#]]></description><category></category></item><item><title><![CDATA[【LeetCode】Binary Tree Level Order Traversal]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42028789</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42028789</guid><author>Mars_NAVY</author><pubDate>Fri, 19 Dec 2014 16:04:05 +0800</pubDate><description><![CDATA[题目




Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree {3,9,20,#,#,15,7},

    3
   / \
]]></description><category></category></item><item><title><![CDATA[【LeetCode】Symmetric Tree]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42006151</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42006151</guid><author>Mars_NAVY</author><pubDate>Thu, 18 Dec 2014 15:38:36 +0800</pubDate><description><![CDATA[题目


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




B]]></description><category></category></item><item><title><![CDATA[【LeetCode】Balanced Binary Tree]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42005187</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/42005187</guid><author>Mars_NAVY</author><pubDate>Thu, 18 Dec 2014 14:33:21 +0800</pubDate><description><![CDATA[题目


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 nev]]></description><category></category></item><item><title><![CDATA[酒桌上的计算机网络]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/41982803</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/41982803</guid><author>Mars_NAVY</author><pubDate>Wed, 17 Dec 2014 15:57:21 +0800</pubDate><description><![CDATA[前言：很有趣，很有意思的一篇文章，找资料在别人博客上无意发现的，原文链接：http://raychase.iteye.com/blog/1388742




酒宴开始。

 

酒杯盛酒，酒杯碰撞，这是物理层；

你要根据不同人的外貌特征找到你要敬酒的人所坐的位置，这是IP协议（网络层）；

你明白，敬酒的实际目的是加深感情，这在应用层，而这酒中的感情，才是报文的数据部]]></description><category></category></item><item><title><![CDATA[【LeetCode】Combination Sum]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/41982399</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/41982399</guid><author>Mars_NAVY</author><pubDate>Wed, 17 Dec 2014 15:38:18 +0800</pubDate><description><![CDATA[题目


Given a set of candidate numbers (C) and a target number (T), find all unique combinations
 in C where the candidate numbers sums to T.

The same repeated number may be chosen from C unlimi]]></description><category></category></item><item><title><![CDATA[【LeetCode】3Sum Closest]]></title><link>https://blog.youkuaiyun.com/Mars_NAVY/article/details/41925869</link><guid>https://blog.youkuaiyun.com/Mars_NAVY/article/details/41925869</guid><author>Mars_NAVY</author><pubDate>Sun, 14 Dec 2014 16:14:59 +0800</pubDate><description><![CDATA[题目


Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the
 three integers. You may assume that each input would ha]]></description><category></category></item></channel></rss>