<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[GODBAR的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/GODBAR</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; GODBAR]]></copyright><item><title><![CDATA[Docker Harbor 安装]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/125345429</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/125345429</guid><author>GODBAR</author><pubDate>Sat, 18 Jun 2022 12:04:25 +0800</pubDate><description><![CDATA[docker harbor]]></description><category></category></item><item><title><![CDATA[190.颠倒二进制位 && 191. 位1的个数]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/120693667</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/120693667</guid><author>GODBAR</author><pubDate>Sun, 10 Oct 2021 22:36:13 +0800</pubDate><description><![CDATA[public int reverseBits(int n) {
        int r = 0;
    
		for(int i = 0;i &lt; 32 &amp;&amp; n != 0;i++){
            r= r&lt;&lt;1;
			r = r|(n&amp;1);
			n = n&gt;&gt;1;
		}
        return r;
    }


public int hammingWeight(int n) {
        int r = 0...]]></description><category></category></item><item><title><![CDATA[idea 链接github 无法成功登陆， SpringCloud Config 分布式配置中心配置]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/107297189</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/107297189</guid><author>GODBAR</author><pubDate>Sun, 12 Jul 2020 11:42:27 +0800</pubDate><description><![CDATA[Server前面加上https:// 前缀



uri要写成链接地址 ，写成[git@github.com:godbar/hello-world.git] 不知道为啥总是报错，Auth fail


]]></description><category></category></item><item><title><![CDATA[（2）Android插件化编程思想]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/100088834</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/100088834</guid><author>GODBAR</author><pubDate>Fri, 30 Aug 2019 22:05:00 +0800</pubDate><description><![CDATA[本篇博客是学习《Android插件化开发指南》的一个总结

1. 插件化的优势

a&gt; 快速修复应用中的bug，不需要重新发版本

b&gt; 快速响应需求，能够将应用业务的变化动态的发布给用户

其实以上的两个优点也可以总结成一个，就是用户重新不要重新下载安装APK，就可以更新APK的功能。

2. 插件化编程需要了解和掌握的知识

 a&gt;对Android的框架知识需要有一定的了...]]></description><category></category></item><item><title><![CDATA[(1)Android动态权限申请]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/100087188</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/100087188</guid><author>GODBAR</author><pubDate>Mon, 26 Aug 2019 23:36:41 +0800</pubDate><description><![CDATA[Android权限的申请有两种方式，静态获取和动态获取。

静态获取：是在APP安装的时候一次性获取App所需要的所有权限，用户不清楚在什么情况下需要哪些权限

动态获取：只有在使用的使用才去获取权限，由用户决定是否授予，用户能够清楚的知道app在哪些场景下申请的了什么权限

Android权限的申请由静态方法变到动态方式，体现了Google在手机安全机制上的努力。

androd中有各种各样的权...]]></description><category></category></item><item><title><![CDATA[通过Launcher启动应用的过程分析]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/86684079</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/86684079</guid><author>GODBAR</author><pubDate>Tue, 29 Jan 2019 00:12:54 +0800</pubDate><description><![CDATA[通过Launcher启动应用的过程分析

通过Lanucher启动 应用时会调用Lanucher的onClick方法。


     Lanucher.java
    /**
     * Launches the intent referred by the clicked shortcut.
     *
     * @param v The view representing the c...]]></description><category></category></item><item><title><![CDATA[ActivityManagerService 构造方法分析]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/86669804</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/86669804</guid><author>GODBAR</author><pubDate>Sun, 27 Jan 2019 22:51:42 +0800</pubDate><description><![CDATA[                    ActivityManagerService 构造方法分析

参考：https://blog.youkuaiyun.com/u013122625/article/details/53433064

本文主要分析ActivityManagerService的构造方法中所做的事情，先看代码。


// Note: This method is invoked on the ...]]></description><category></category></item><item><title><![CDATA[Handler Messenger 使用]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/86557753</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/86557753</guid><author>GODBAR</author><pubDate>Sun, 20 Jan 2019 11:31:48 +0800</pubDate><description><![CDATA[                            Handler Messenger 使用

Android中如果所有的线程都可以更新UI那么会造成同步问题，因为UI的访问不是同步的，所以如果所有的线程都更新UI就会造成数据混乱，不为UI加锁进行同步的原因是这样会造成性能问题，所有的线程都想更新UI，造成大量的线程等待，影响性能。所以在android中只允许主线程更新UI，并且主线程也最好应...]]></description><category></category></item><item><title><![CDATA[Android Studio 工程目录下各个文件的作用]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/86378412</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/86378412</guid><author>GODBAR</author><pubDate>Sat, 12 Jan 2019 21:48:13 +0800</pubDate><description><![CDATA[                        Android Studio 工程目录下各个文件的作用

不创造知识，我只是知识的搬运工。本篇文章照抄https://developer.android.com/studio/build/#build-config，建议直接点击链接

下面的工程目录示意图



1. settings.gradle文件位于项目根目录，用于指示Gradle在构建应用时...]]></description><category></category></item><item><title><![CDATA[32. Longest Valid Parentheses]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/56032453</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/56032453</guid><author>GODBAR</author><pubDate>Mon, 20 Feb 2017 21:15:55 +0800</pubDate><description><![CDATA[Longest Valid Parentheses

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.
For "(()", the longest valid parenthe]]></description><category></category></item><item><title><![CDATA[leetcode31. Next Permutation]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/55211563</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/55211563</guid><author>GODBAR</author><pubDate>Wed, 15 Feb 2017 16:45:39 +0800</pubDate><description><![CDATA[Next Permutation

参考：https://yq.aliyun.com/articles/863

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.
If such arrangement i]]></description><category></category></item><item><title><![CDATA[leetcode30:Substring with Concatenation of All Words]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/55047955</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/55047955</guid><author>GODBAR</author><pubDate>Mon, 13 Feb 2017 14:04:28 +0800</pubDate><description><![CDATA[Substring with Concatenation of All Words



转载：www.cnblogs.com/zihaowang/p/4507979.html

You are given a string, s, and a list of words,
words, that are all of the same length. Find all starti]]></description><category></category></item><item><title><![CDATA[Java语言中的位运算及总结]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/54603093</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/54603093</guid><author>GODBAR</author><pubDate>Wed, 18 Jan 2017 17:28:18 +0800</pubDate><description><![CDATA[Java语言中的位运算及总结 



转载：http://blog.youkuaiyun.com/ujswml/article/details/5642991

二进制运算符
　　由于计算机内部的数据都以二进制的形式存在，所以在Java语言中提供了直接操作二进制的运算符，这就是下面要讲解的位运算符和移位运算符。
　　使用二进制的运算符，可以直接在二进制的基础上对数字进行操作，执行的效率比一般的]]></description><category></category></item><item><title><![CDATA[leetcode29:Divide Two Integers]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/54602210</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/54602210</guid><author>GODBAR</author><pubDate>Wed, 18 Jan 2017 16:12:40 +0800</pubDate><description><![CDATA[Divide Two Integers 

Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.




package leetcode;

public class leet29 {
	public static ]]></description><category></category></item><item><title><![CDATA[leetcode28: Implement strStr()]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/54345364</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/54345364</guid><author>GODBAR</author><pubDate>Wed, 11 Jan 2017 17:08:29 +0800</pubDate><description><![CDATA[Implement strStr



Implement strStr().
Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
对haystack进行遍历，比较当前下标下，长度为needle.length()长的字符串是否与]]></description><category></category></item><item><title><![CDATA[设计模式：单例模式]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/54315285</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/54315285</guid><author>GODBAR</author><pubDate>Tue, 10 Jan 2017 17:05:50 +0800</pubDate><description><![CDATA[单例模式
参考：百度百科

      单例模式是一种常用的软件设计模式。在它的核心结构中只包含一个被称为单例的特殊类。通过单例模式可以保证系统中一个类只有一个实例


     对于系统中的某些类来说，只有一个实例很重要，例如，一个系统中可以存在多个打印任务，但是只能有一个正在工作的任务；一个系统只能有一个窗口管理器或文件系统；一个系统只能有一个计时工具或ID(序号)生成器。如在Wi]]></description><category></category></item><item><title><![CDATA[leetcode27:Remove Element]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/54232422</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/54232422</guid><author>GODBAR</author><pubDate>Sun, 08 Jan 2017 10:34:16 +0800</pubDate><description><![CDATA[Remove Element

Given an array and a value, remove all instances of that value in place and return the new length.
Do not allocate extra space for another array, you must do this in place with cons]]></description><category></category></item><item><title><![CDATA[leetcode26:Remove Duplicates from Sorted Array]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/54231985</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/54231985</guid><author>GODBAR</author><pubDate>Sun, 08 Jan 2017 09:36:48 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[leetcode25: Reverse Nodes in k-Group]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/54177883</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/54177883</guid><author>GODBAR</author><pubDate>Sat, 07 Jan 2017 20:33:01 +0800</pubDate><description><![CDATA[Reverse Nodes in k-Group 

Given a linked list, reverse the nodes of a linked listk at a time and return its modified list.
k is a positive integer and is less than or equal to the length of the li]]></description><category></category></item><item><title><![CDATA[leetcode24:Swap Nodes in Pairs]]></title><link>https://blog.youkuaiyun.com/GODBAR/article/details/54015885</link><guid>https://blog.youkuaiyun.com/GODBAR/article/details/54015885</guid><author>GODBAR</author><pubDate>Wed, 04 Jan 2017 09:33:55 +0800</pubDate><description><![CDATA[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 on]]></description><category></category></item></channel></rss>