<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Big_Heart_C的专栏]]></title><description><![CDATA[We all need a big heart !]]></description><link>https://blog.youkuaiyun.com/Big_Heart_C</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Big_Heart_C]]></copyright><item><title><![CDATA[Android BottomSheet 的一些坑]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/51116199</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/51116199</guid><author>Big_Heart_C</author><pubDate>Sun, 10 Apr 2016 23:17:22 +0800</pubDate><description><![CDATA[Android Bottom sheet Dialog 的 坑]]></description><category></category></item><item><title><![CDATA[foreach VS for loop]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/50966300</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/50966300</guid><author>Big_Heart_C</author><pubDate>Wed, 23 Mar 2016 20:26:01 +0800</pubDate><description><![CDATA[foreach VS for loop]]></description><category></category></item><item><title><![CDATA[实战：Android 时间、天气widget]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/49827033</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/49827033</guid><author>Big_Heart_C</author><pubDate>Sat, 14 Nov 2015 00:32:51 +0800</pubDate><description><![CDATA[Android 时间、天气widget，Yahoo天气查询API]]></description><category></category></item><item><title><![CDATA[Android SQLite增删改查、升级的基本使用]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/49660283</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/49660283</guid><author>Big_Heart_C</author><pubDate>Thu, 05 Nov 2015 11:19:15 +0800</pubDate><description><![CDATA[Android SQLite增删改查、升级的基本使用
getWritableDatabase(), getReadableDatabase()]]></description><category></category></item><item><title><![CDATA[OS X 10.11 mysql : The server quit without updating PID file]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/48524795</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/48524795</guid><author>Big_Heart_C</author><pubDate>Wed, 04 Nov 2015 23:30:23 +0800</pubDate><description><![CDATA[我是使用homebrew安装的。关于如何安装homebrew，可以参考这个链接 
这里主要想记录在安装过程中碰到的一个问题：系统版本：OS X 10.11 
 在iTerm 中使用brew安装mysql
  brew install mysql
但是安装完后，输入：
  mysql.server restart
会报错误：
  MySQL ERROR! The server quit without]]></description><category></category></item><item><title><![CDATA[一篇不错的讲解Java异常的文章]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/48093517</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/48093517</guid><author>Big_Heart_C</author><pubDate>Sat, 29 Aug 2015 22:53:37 +0800</pubDate><description><![CDATA[六种异常处理的陋习你觉得自己是一个Java专家吗？是否肯定自己已经全面掌握了Java的异常处理机制？在下面这段代码中，你能够迅速找出异常处理的六个问题吗？ OutputStreamWriter out = ... 
java.sql.Connection conn = ... 
try { // ⑸ 
　Statement stat = conn.createStatement(); 
　Resul]]></description><category></category></item><item><title><![CDATA[使用Drawable实时画时钟]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/47323895</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/47323895</guid><author>Big_Heart_C</author><pubDate>Thu, 06 Aug 2015 22:21:43 +0800</pubDate><description><![CDATA[使用Drawable实时画时钟]]></description><category></category></item><item><title><![CDATA[第一章《人造与天生》]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/44539783</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/44539783</guid><author>Big_Heart_C</author><pubDate>Sun, 22 Mar 2015 18:54:49 +0800</pubDate><description><![CDATA[前言： 
  失控一书在寒假之时便以电子书的形式读了10%，着实被其中的思想给惊艳到了，于是决定买一本实体书认真的重头到尾看一遍，同时当做收藏。然何谓认真？遂想到以写札记的形式将阅读过程中有感的地方加以思考，一来翻遍日后重新翻阅，同时也可随时添加新观点。其中观点若有偏颇欢迎指出！本章主旨：机器，正在生物化；而生物，正在工程化。
    本章作为开篇第一章，先以总结性的语气向我们阐述一个结论，一个正悄]]></description><category></category></item><item><title><![CDATA[贪心算法]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/44175673</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/44175673</guid><author>Big_Heart_C</author><pubDate>Tue, 10 Mar 2015 18:40:02 +0800</pubDate><description><![CDATA[poj 1716 
题意：
  [a,b]表示一个包含a到b（包含a，b）的集合。 
  现在给出 n 个这样的集合，让我们来找出一个集合 v，v中包含的元素与给出的n 个集合中的每一集合都至少有两个一样的元素，问v 集合的元素至少有多少个？
思路：
  1.将n个集合按照末元素的大小从小到大排序。 
  2.取第一个集合的后两个数，分别记为last1,last2（last2>last1），设集合v]]></description><category></category></item><item><title><![CDATA[数论——GCD]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/44136397</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/44136397</guid><author>Big_Heart_C</author><pubDate>Sun, 08 Mar 2015 20:31:01 +0800</pubDate><description><![CDATA[ZOJ Problem Set - 3846]]></description><category></category></item><item><title><![CDATA[水题]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/44120673</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/44120673</guid><author>Big_Heart_C</author><pubDate>Sat, 07 Mar 2015 21:44:39 +0800</pubDate><description><![CDATA[ZOJ Problem Set - 3844 
思路：
  题中 n<=10，所以不可能存在”Nooooooo!”的情况，所以直接暴力求解
ps：为什么要写这道题？因为粗心有个地方没注意，写下来当做教训！]]></description><category></category></item><item><title><![CDATA[网络流——最大流]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/44059193</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/44059193</guid><author>Big_Heart_C</author><pubDate>Wed, 04 Mar 2015 13:54:50 +0800</pubDate><description><![CDATA[poj 3436
网络流]]></description><category></category></item><item><title><![CDATA[图论——最小生成树]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43898747</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43898747</guid><author>Big_Heart_C</author><pubDate>Sat, 21 Feb 2015 17:01:36 +0800</pubDate><description><![CDATA[最小生成树]]></description><category></category></item><item><title><![CDATA[图论——最短路径]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43898187</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43898187</guid><author>Big_Heart_C</author><pubDate>Sat, 21 Feb 2015 12:32:27 +0800</pubDate><description><![CDATA[poj 1860]]></description><category></category></item><item><title><![CDATA[图论——割点]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43869937</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43869937</guid><author>Big_Heart_C</author><pubDate>Tue, 17 Feb 2015 23:49:06 +0800</pubDate><description><![CDATA[poj1523]]></description><category></category></item><item><title><![CDATA[图论——割边]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43865633</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43865633</guid><author>Big_Heart_C</author><pubDate>Tue, 17 Feb 2015 11:42:59 +0800</pubDate><description><![CDATA[图论——割边]]></description><category></category></item><item><title><![CDATA[图论——二分图匹配]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43535175</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43535175</guid><author>Big_Heart_C</author><pubDate>Thu, 05 Feb 2015 20:25:23 +0800</pubDate><description><![CDATA[二分匹配]]></description><category></category></item><item><title><![CDATA[图论——拓扑排序]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43191069</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/43191069</guid><author>Big_Heart_C</author><pubDate>Tue, 27 Jan 2015 09:43:20 +0800</pubDate><description><![CDATA[Genealogical tree




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 3150
 
Accepted: 2130
 
Special Judge





Description

The system of Martians' blood relatio]]></description><category></category></item><item><title><![CDATA[用 stack 解决“八皇后问题”]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/41174449</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/41174449</guid><author>Big_Heart_C</author><pubDate>Sun, 16 Nov 2014 17:39:40 +0800</pubDate><description><![CDATA[题目：


/*利用栈结构实现八皇后问题。
   八皇后问题19世纪著名的数学家高斯于1850年提出的。他的问题是：在8*8的棋盘上放置8个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列、同一斜线上。请设计算法打印所有可能的摆放方法。
   提示：
   1、可以使用递归或非递归两种方法实现
   2、实现一个关键算法：判断任意两个皇后是否在同一行、同一列和同一斜线上
   ]]></description><category></category></item><item><title><![CDATA[POJ 3050 Hopscotch]]></title><link>https://blog.youkuaiyun.com/Big_Heart_C/article/details/40715901</link><guid>https://blog.youkuaiyun.com/Big_Heart_C/article/details/40715901</guid><author>Big_Heart_C</author><pubDate>Sun, 02 Nov 2014 21:23:29 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
//#include 
using namespace std;
void DFS(int i, int j, int time);
set  S;
int num[5][5];
string str_temp = "ABCDEF";
set::iterator index;
int a[] = { -1, 0, 1, 0 }, b[]]]></description><category></category></item></channel></rss>