<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[aprilcuhk的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/aprilcuhk</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; aprilcuhk]]></copyright><item><title><![CDATA[Flutter ListView UI异常]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/101520028</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/101520028</guid><author>aprilcuhk</author><pubDate>Fri, 27 Sep 2019 11:12:54 +0800</pubDate><description><![CDATA[一个是正常的ListView，另外一个是带分割线的listview

为什么正常的listview，body99那里没有展示完整？？？

代码如下




  @override
  Widget build(BuildContext context) {
    // This method is rerun every time setState is called, for in...]]></description><category></category></item><item><title><![CDATA[RePlugin的demo-菜鸟入门跑起来版]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/92790266</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/92790266</guid><author>aprilcuhk</author><pubDate>Tue, 18 Jun 2019 15:03:34 +0800</pubDate><description><![CDATA[新建一个项目

1、项目的build.gradle中增加

①如果gradle版本是3.2.0+，要改成3.1.4，否则会掉进很大的坑（亲测）

②增加 classpath 'com.qihoo360.replugin:replugin-host-gradle:2.3.1'



2、在项目最下面的settings.gradle中增加插件

原来是只有app的，增加这一行

include ':...]]></description><category></category></item><item><title><![CDATA[第一行代码-第四章BroadcastReceiver-（1）]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/84826632</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/84826632</guid><author>aprilcuhk</author><pubDate>Wed, 05 Dec 2018 11:44:06 +0800</pubDate><description><![CDATA[
package com.example.huiqian.myapplication;

import android.content.BroadcastReceiver;
import android.content.Context;
import android.content.Intent;
import android.content.IntentFilter;
import androi...]]></description><category></category></item><item><title><![CDATA[第一行代码碰到的问题-default activity not fond]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/84763720</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/84763720</guid><author>aprilcuhk</author><pubDate>Mon, 03 Dec 2018 14:27:23 +0800</pubDate><description><![CDATA[在第二章intent这里

写完xml后

报错出现，default activity not fond

检查了AndroidManifest很多次，确认没有问题

 

点击run左边的app下面的edit configurations

launch options那里选Nothing

重新run这个项目 就ok了...]]></description><category></category></item><item><title><![CDATA[第一行代码-常见控件的使用demo1]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/84645663</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/84645663</guid><author>aprilcuhk</author><pubDate>Fri, 30 Nov 2018 11:10:54 +0800</pubDate><description><![CDATA[activity_main.xml


&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;utf-8&quot;?&amp;gt;
&amp;lt;LinearLayout xmlns:android=&quot;http://schemas.android.com/apk/res/android&quot;
    xmlns:app=&quot;http://schemas.android.com/apk/res-auto&quot;
   ...]]></description><category></category></item><item><title><![CDATA[第一行代码-RecyclerViewDemo(1)-实现横向滚动]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/84581920</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/84581920</guid><author>aprilcuhk</author><pubDate>Wed, 28 Nov 2018 11:53:05 +0800</pubDate><description><![CDATA[activity_main.xml


&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;utf-8&quot;?&amp;gt;
&amp;lt;LinearLayout xmlns:android=&quot;http://schemas.android.com/apk/res/android&quot;
    xmlns:app=&quot;http://schemas.android.com/apk/res-auto&quot;
   ...]]></description><category></category></item><item><title><![CDATA[第一行代码-ListViewDemo(3)]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/84580551</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/84580551</guid><author>aprilcuhk</author><pubDate>Wed, 28 Nov 2018 10:48:42 +0800</pubDate><description><![CDATA[点击事件，对应120页

MainActivity.java


import android.support.v7.app.AppCompatActivity;
import android.os.Bundle;
import android.view.View;
import android.widget.AdapterView;
import android.widget.ArrayAdap...]]></description><category></category></item><item><title><![CDATA[第一行代码-ListViewDemo（2）-读书笔记]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/84579865</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/84579865</guid><author>aprilcuhk</author><pubDate>Wed, 28 Nov 2018 10:23:21 +0800</pubDate><description><![CDATA[对应第一行代码的114页

activity_main.xml


&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;utf-8&quot;?&amp;gt;
&amp;lt;LinearLayout xmlns:android=&quot;http://schemas.android.com/apk/res/android&quot;
android:orientation=&quot;vertical&quot;
android:layout...]]></description><category></category></item><item><title><![CDATA[第一行代码-ListViewDemo(1)]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/84572815</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/84572815</guid><author>aprilcuhk</author><pubDate>Tue, 27 Nov 2018 20:23:55 +0800</pubDate><description><![CDATA[activity_main.xml构造：


&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;utf-8&quot;?&amp;gt;
&amp;lt;LinearLayout xmlns:android=&quot;http://schemas.android.com/apk/res/android&quot;
android:orientation=&quot;vertical&quot;
android:layout_width=&quot;ma]]></description><category></category></item><item><title><![CDATA[构建第一个LuaView应用]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/84197860</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/84197860</guid><author>aprilcuhk</author><pubDate>Sun, 18 Nov 2018 13:55:31 +0800</pubDate><description><![CDATA[1、 从GitHub克隆最新版本的LuaViewSDK到本地。

- github网址: https://github.com/alibaba/LuaViewSDK

- https方式：git clone https://github.com/alibaba/LuaViewSDK.git

- ssh方式：git clone git@github.com:alibaba/LuaViewSDK.g...]]></description><category></category></item><item><title><![CDATA[剑指offer所有题目java版]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/82933090</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/82933090</guid><author>aprilcuhk</author><pubDate>Wed, 03 Oct 2018 18:28:48 +0800</pubDate><description><![CDATA[
//面试题1：赋值运算符函数
/**
 * 赋值运算符函数
 * 1.对于传入的参数，不应该被修改，使用final修饰；
 * 2.如果两个对象相同或值相等，不进行操作，直接返回；
 * 3.返回值最好为this，这样可以使赋值链接起来。
 * 一个缺点：此赋值从左到右进行，a=b=c等价于a=c，b不会被赋值；
 * 而如果是String的=运算，a,b都会被赋成c的值。
 */
public...]]></description><category></category></item><item><title><![CDATA[剑指Offer-平衡二叉树]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/82724503</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/82724503</guid><author>aprilcuhk</author><pubDate>Sun, 16 Sep 2018 14:47:04 +0800</pubDate><description><![CDATA[题目描述

输入一棵二叉树，判断该二叉树是否是平衡二叉树。


public class Solution {
 public boolean IsBalanced_Solution(TreeNode root) {
        return getDepth(root) != -1;
    }
     
    private int getDepth(TreeNode root) {
...]]></description><category></category></item><item><title><![CDATA[剑指Offer-二进制中1的个数]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/82724407</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/82724407</guid><author>aprilcuhk</author><pubDate>Sun, 16 Sep 2018 14:36:13 +0800</pubDate><description><![CDATA[题目描述

输入一个整数，输出该数二进制表示中1的个数。其中负数用补码表示。


public class Solution {
    public int NumberOf1(int n) {
        int count=0;
        while(n!=0){
            ++count;
            n=(n-1)&amp;amp;n;
        }
 ...]]></description><category></category></item><item><title><![CDATA[剑指Offer-连续子数组的最大和]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/82724368</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/82724368</guid><author>aprilcuhk</author><pubDate>Sun, 16 Sep 2018 14:33:33 +0800</pubDate><description><![CDATA[题目描述

HZ偶尔会拿些专业问题来忽悠那些非计算机专业的同学。今天测试组开完会后,他又发话了:在古老的一维模式识别中,常常需要计算连续子向量的最大和,当向量全为正数的时候,问题很好解决。但是,如果向量中包含负数,是否应该包含某个负数,并期望旁边的正数会弥补它呢？例如:{6,-3,-2,7,-15,1,2,2},连续子向量的最大和为8(从第0个开始,到第3个为止)。给一个数组，返回它的最大连续子序...]]></description><category></category></item><item><title><![CDATA[剑指Offer-构建乘积数组]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/82724086</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/82724086</guid><author>aprilcuhk</author><pubDate>Sun, 16 Sep 2018 14:12:53 +0800</pubDate><description><![CDATA[题目描述

给定一个数组A[0,1,...,n-1],请构建一个数组B[0,1,...,n-1],其中B中的元素B[i]=A[0]*A[1]*...*A[i-1]*A[i+1]*...*A[n-1]。不能使用除法。


import java.util.ArrayList;
public class Solution {
    public int[] multiply(int[] A) {
 ...]]></description><category></category></item><item><title><![CDATA[剑指Offer-矩形覆盖]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/82723442</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/82723442</guid><author>aprilcuhk</author><pubDate>Sun, 16 Sep 2018 13:36:29 +0800</pubDate><description><![CDATA[题目描述

我们可以用2*1的小矩形横着或者竖着去覆盖更大的矩形。请问用n个2*1的小矩形无重叠地覆盖一个2*n的大矩形，总共有多少种方法？


//递归
public class Solution {
    public int RectCover(int target) {
        if(target&amp;lt;=0){
            return 0;
        }el...]]></description><category></category></item><item><title><![CDATA[剑指Offer-变态跳台阶]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/82723393</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/82723393</guid><author>aprilcuhk</author><pubDate>Sun, 16 Sep 2018 13:33:39 +0800</pubDate><description><![CDATA[题目描述

一只青蛙一次可以跳上1级台阶，也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。


public class Solution {
    public int JumpFloorII(int target) {
       if(target&amp;lt;=0)
           return 0;
        return 1&amp;lt;&amp;lt;(t...]]></description><category></category></item><item><title><![CDATA[剑指Offer-跳台阶]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/82723289</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/82723289</guid><author>aprilcuhk</author><pubDate>Sun, 16 Sep 2018 13:29:32 +0800</pubDate><description><![CDATA[题目描述

一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法（先后次序不同算不同的结果）。


public class Solution {
    public int JumpFloor(int target) {
        if(target&amp;lt;1){
            return -1;
        }else if(targ...]]></description><category></category></item><item><title><![CDATA[剑指offer-斐波那契序列（循环，不用递归）]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/82723071</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/82723071</guid><author>aprilcuhk</author><pubDate>Sun, 16 Sep 2018 13:19:59 +0800</pubDate><description><![CDATA[题目描述

大家都知道斐波那契数列，现在要求输入一个整数n，请你输出斐波那契数列的第n项（从0开始，第0项为0）。

n&amp;lt;=39


public class Solution {
    public int Fibonacci(int n) {
        int preNum=1;
        int prePreNum=0;
        int result=0;
   ...]]></description><category></category></item><item><title><![CDATA[剑指offer-斐波那契数列]]></title><link>https://blog.youkuaiyun.com/aprilcuhk/article/details/82722658</link><guid>https://blog.youkuaiyun.com/aprilcuhk/article/details/82722658</guid><author>aprilcuhk</author><pubDate>Sun, 16 Sep 2018 13:03:48 +0800</pubDate><description><![CDATA[题目描述

大家都知道斐波那契数列，现在要求输入一个整数n，请你输出斐波那契数列的第n项（从0开始，第0项为0）。

n&amp;lt;=39


public class Solution {
    public int Fibonacci(int n) {
        if(n&amp;lt;=0){
            return 0;
        
        }else if(n==...]]></description><category></category></item></channel></rss>