<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[大德如危的博客]]></title><description><![CDATA[不积跬步无以至千里 不积小流无以成江海]]></description><link>https://blog.youkuaiyun.com/u010771890</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u010771890]]></copyright><item><title><![CDATA[K8s网络实战分析之service调用]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/103226784</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/103226784</guid><author>u010771890</author><pubDate>Sun, 24 Nov 2019 17:53:52 +0800</pubDate><description><![CDATA[在上一篇文章K8s网络实战分析之Calico-ipip模式中，我们通过Pod之间进行ping操作，对基于Calico-IPIP模式的K8s网络进行了实战学习与分析。单单进行Pod-Pod的访问只是K8s的基础功能，基于Service的访问才是K8s的网络核心。本文将基于上一篇文章所搭建的K8s网络，与大家一起探讨，Service访问的IP报文在K8s集群内的流动与原理！

#实验准备
为了方便操...]]></description><category></category></item><item><title><![CDATA[K8s网络实战分析之Calico-ipip模式]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/103224004</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/103224004</guid><author>u010771890</author><pubDate>Sun, 24 Nov 2019 14:11:55 +0800</pubDate><description><![CDATA[Kubernetes为每个Pod都分配了唯一的IP地址，一个Pod里的多个容器共享PodIp地址。Kubernetes要求底层网络支持集群内任意两个Pod间的TCP/IP直接通信。Kubernetes的跨主机任意Pod访问方式主要是遵循CNI容器网络规范，目前已经有多个开源组件支持CNI，包括Flannel、Open VSwitch、Calico等。本文主要介绍在Calico的ipip模式下，K...]]></description><category></category></item><item><title><![CDATA[docker从零构建go应用并部署到K8s集群]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/102727814</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/102727814</guid><author>u010771890</author><pubDate>Thu, 24 Oct 2019 18:48:07 +0800</pubDate><description><![CDATA[本文详细介绍使用docker构建一个简单的go服务器镜像，并将容器实例部署到K8s集群中。

  使用的demo是一个go网络聊天室。具有客户端和服务器端。

编写go程序 

服务器端代码如下：


//chatroom.go
package main

import (
	"bufio"
	"fmt"
	"net"
	"os"
)

//一个聊天服务器demo
func ma...]]></description><category></category></item><item><title><![CDATA[leetCode练习（172）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80716897</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80716897</guid><author>u010771890</author><pubDate>Sun, 17 Jun 2018 10:02:03 +0800</pubDate><description><![CDATA[题目：Factorial Trailing Zeroes难度：EASY问题描述：Given an integer n, return the number of trailing zeroes in n!.Example 1:Input: 3
Output: 0
Explanation: 3! = 6, no trailing zero.Example 2:Input: 5
Output: 1
E...]]></description><category></category></item><item><title><![CDATA[leetCode练习（165）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80694433</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80694433</guid><author>u010771890</author><pubDate>Thu, 14 Jun 2018 16:17:11 +0800</pubDate><description><![CDATA[题目：Compare Version Numbers难度：medium问题描述：Compare two version numbers version1 and version2.If version1 &amp;gt; version2 return 1; if version1 &amp;lt; version2 return -1;otherwise return 0.You may assume that...]]></description><category></category></item><item><title><![CDATA[leetCode练习（162）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80669497</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80669497</guid><author>u010771890</author><pubDate>Tue, 12 Jun 2018 18:41:50 +0800</pubDate><description><![CDATA[题目：Find Peak Element难度：medium问题描述：A peak element is an element that is greater than its neighbors.Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return its index.The arr...]]></description><category></category></item><item><title><![CDATA[leetCode练习（153）、（154）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80666985</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80666985</guid><author>u010771890</author><pubDate>Tue, 12 Jun 2018 16:13:33 +0800</pubDate><description><![CDATA[题目：Find Minimum in Rotated Sorted Array难度：medium问题描述：Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e.,  [0,1,2,4,5,6,7] might become  [4,5,6,7,0,1,2]...]]></description><category></category></item><item><title><![CDATA[leetCode练习（152）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80645232</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80645232</guid><author>u010771890</author><pubDate>Sun, 10 Jun 2018 21:49:13 +0800</pubDate><description><![CDATA[题目：Maximum Product Subarray难度：medium问题描述：Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.Example 1:Input: [2,3,...]]></description><category></category></item><item><title><![CDATA[leetCode练习（151）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80644513</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80644513</guid><author>u010771890</author><pubDate>Sun, 10 Jun 2018 20:41:29 +0800</pubDate><description><![CDATA[题目：Reverse Words in a String难度：medium问题描述： Given an input string, reverse the string word by word.Example:  Input: &quot;the sky is blue&quot;,
Output: &quot;blue is sky the&quot;.
结题思路：遍历字符串，找到每个单词，逆序拼接。代码如下：public stat...]]></description><category></category></item><item><title><![CDATA[leetCode练习（150）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80643923</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80643923</guid><author>u010771890</author><pubDate>Sun, 10 Jun 2018 19:37:22 +0800</pubDate><description><![CDATA[题目：Evaluate Reverse Polish Notation难度：medium问题描述：Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another exp...]]></description><category></category></item><item><title><![CDATA[leetCode练习（148）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80598104</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80598104</guid><author>u010771890</author><pubDate>Wed, 06 Jun 2018 17:21:22 +0800</pubDate><description><![CDATA[题目：Sort List难度：medium问题描述：Sort a linked list in O(n log n) time using constant space complexity.Example 1:Input: 4-&amp;gt;2-&amp;gt;1-&amp;gt;3
Output: 1-&amp;gt;2-&amp;gt;3-&amp;gt;4
Example 2:Input: -1-&amp;gt;5-&amp;gt;3-&amp;gt;4-&amp;...]]></description><category></category></item><item><title><![CDATA[leetCode练习（147）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80597667</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80597667</guid><author>u010771890</author><pubDate>Wed, 06 Jun 2018 17:01:15 +0800</pubDate><description><![CDATA[题目：Insertion Sort List难度：medium问题描述：使用插入排序对List进行排序求解思路：从左到右，依次将node插入到左边已经排好的list中代码如下：public static ListNode insertionSortList(ListNode head) {
        if(head==null || head.next==null) return head;...]]></description><category></category></item><item><title><![CDATA[leetCode练习（143）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80596057</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80596057</guid><author>u010771890</author><pubDate>Wed, 06 Jun 2018 15:44:08 +0800</pubDate><description><![CDATA[题目：Reorder List难度：medium问题描述：Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You may not modify the values in the list's nodes, only nodes itself may be changed.Exa...]]></description><category></category></item><item><title><![CDATA[leetCode练习（141）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80592530</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80592530</guid><author>u010771890</author><pubDate>Wed, 06 Jun 2018 11:29:40 +0800</pubDate><description><![CDATA[题目：Linked List Cycle难度：easy问题描述：Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?解题思路：方法2：构造一个blank节点，遍历让所有的node.next都指向blank，仅最后一个不指向，如果最后尾节...]]></description><category></category></item><item><title><![CDATA[leetCode练习（140）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80592083</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80592083</guid><author>u010771890</author><pubDate>Wed, 06 Jun 2018 11:07:16 +0800</pubDate><description><![CDATA[题目：Single Number难度：hard问题描述：Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary wor...]]></description><category></category></item><item><title><![CDATA[leetCode练习（139）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80591455</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80591455</guid><author>u010771890</author><pubDate>Wed, 06 Jun 2018 10:35:16 +0800</pubDate><description><![CDATA[题目：Single Number难度：medium问题描述：Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more ...]]></description><category></category></item><item><title><![CDATA[leetCode练习（138）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80589923</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80589923</guid><author>u010771890</author><pubDate>Wed, 06 Jun 2018 09:11:13 +0800</pubDate><description><![CDATA[题目：Copy List with Random Pointer难度：medium问题描述：A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of t...]]></description><category></category></item><item><title><![CDATA[leetCode练习（135）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80586865</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80586865</guid><author>u010771890</author><pubDate>Tue, 05 Jun 2018 20:38:13 +0800</pubDate><description><![CDATA[题目：candy难度：HARD问题描述：There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have...]]></description><category></category></item><item><title><![CDATA[leetCode练习（1）]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/80584564</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/80584564</guid><author>u010771890</author><pubDate>Tue, 05 Jun 2018 17:32:57 +0800</pubDate><description><![CDATA[题目：gas station难度：MEDIUM问题描述：There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to tra...]]></description><category></category></item><item><title><![CDATA[Class.forName()的作用]]></title><link>https://blog.youkuaiyun.com/u010771890/article/details/77542482</link><guid>https://blog.youkuaiyun.com/u010771890/article/details/77542482</guid><author>u010771890</author><pubDate>Thu, 24 Aug 2017 21:52:17 +0800</pubDate><description><![CDATA[我们在加载数据库驱动的时候，一般会调用
Class.forName("com.mysql.jdbc.Driver");
    它的作用其实是获得数据库驱动的Class对象。
定义：
Class.forName：返回与给定的字符串名称相关联类或接口的Class对象。
Class.forName是一个静态方法，同样可以用来加载类。该方法有两种形式：Class.forName(String ]]></description><category></category></item></channel></rss>