<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[7-SEVENS]]></title><description><![CDATA[跑马拉松的程序员]]></description><link>https://blog.youkuaiyun.com/developer1024</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; developer1024]]></copyright><item><title><![CDATA[编程开发相关书籍资源收集整理]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/103250428</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/103250428</guid><author>developer1024</author><pubDate>Tue, 26 Nov 2019 09:38:09 +0800</pubDate><description><![CDATA[Repository Describe
https://github.com/7-sevens/Developer-Books



repository:  Developer Books


brief: 编程开发相关书籍收集分享，持续更新…


remark: 关于本仓库端相关pdf书籍文件，100M以内的文件会直接上传到该仓库，大于100M到会上传到网盘



编程语言相关书籍
汇编

《...]]></description><category></category></item><item><title><![CDATA[Android、iPhone手机刘海屏适配判断]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/103241797</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/103241797</guid><author>developer1024</author><pubDate>Mon, 25 Nov 2019 17:13:19 +0800</pubDate><description><![CDATA[Android刘海屏适配判断
import android.app.Activity;
import android.os.Build;
import android.text.TextUtils;
import android.view.DisplayCutout;

import java.lang.reflect.Method;

/**
 *
 * @brief: Notch Tools
...]]></description><category></category></item><item><title><![CDATA[Cocos Creator实用技巧：头像倒计时效果实现]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/103068512</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/103068512</guid><author>developer1024</author><pubDate>Thu, 14 Nov 2019 15:39:16 +0800</pubDate><description><![CDATA[技能CD、头像倒计时这类是游戏中经常出现的一类效果，而具体如何来实现？本文将以头像倒计时为例来讲解说明。。。]]></description><category></category></item><item><title><![CDATA[cocos creator开发过程中问题记录]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/103068077</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/103068077</guid><author>developer1024</author><pubDate>Thu, 14 Nov 2019 15:22:01 +0800</pubDate><description><![CDATA[1. 编辑器不能识别脚本里面@property类型，显示为null，脚本拖不上去
解决方案：
@property的类循环引用导致的，可以改变组件类型到cc.Node解决

2. Cannot read property ‘_assembler’ of null
解决方案：
场景某一个子节点 onload方法里抛出了一个错误，导致后面所有的onload不能顺利执行，导致render组件未能初始化.初...]]></description><category></category></item><item><title><![CDATA[常用方法整理]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/102696420</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/102696420</guid><author>developer1024</author><pubDate>Wed, 23 Oct 2019 10:21:24 +0800</pubDate><description><![CDATA[常用方法整理(代码使用TypeScript编写)
1. 匹配由数字和26个英文字母组成的字符串
/**
 * @brief 匹配由数字和26个英文字母组成的字符串
 * @param str 源字符串
 */
regNumberAndLetter: function (str: string): boolean
{
   let reg = /^[A-Za-z0-9]+$/;  
   retur...]]></description><category></category></item><item><title><![CDATA[LeetCode-11：Container With Most Water]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/102625964</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/102625964</guid><author>developer1024</author><pubDate>Fri, 18 Oct 2019 15:13:35 +0800</pubDate><description><![CDATA[Container With Most Water. 盛最多水的容器.
一、题目
Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of li...]]></description><category></category></item><item><title><![CDATA[LeetCode-10：Regular Expression Matching]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/102587788</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/102587788</guid><author>developer1024</author><pubDate>Wed, 16 Oct 2019 16:22:02 +0800</pubDate><description><![CDATA[Regular Expression Matching. 正则表达式匹配.
一、题目
Given an input string (s) and a pattern §, implement regular expression matching with support for ‘.’ and ‘*’

‘.’ Matches any single character.
‘*’ Matches ...]]></description><category></category></item><item><title><![CDATA[LeetCode-9：Palindrome Number]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/101648649</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/101648649</guid><author>developer1024</author><pubDate>Sat, 28 Sep 2019 23:53:09 +0800</pubDate><description><![CDATA[Palindrome Number. 回文数.
一、题目
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
Example 1:

Input: 121
Output: true

Example 2:

Input...]]></description><category></category></item><item><title><![CDATA[C++专项练习1:数组和指针]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/82291945</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/82291945</guid><author>developer1024</author><pubDate>Sat, 01 Sep 2018 23:25:20 +0800</pubDate><description><![CDATA[一、题目

下面代码会输出()

int main(){
    int a[4]={1,2,3,4};
    int *ptr=(int*)(&amp;amp;a+1);
    printf(&quot;%d&quot;,*(ptr-1));
}

A. 4 
B. 1 
C. 2 
D. 3



二、解析

正确答案：A

本题主要考察对于数组和指针的认识，指针加一的能力由类型决定，即对一个指针加一的结果是对该指针...]]></description><category></category></item><item><title><![CDATA[parallels desktop使用总结]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/81953317</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/81953317</guid><author>developer1024</author><pubDate>Thu, 23 Aug 2018 00:19:09 +0800</pubDate><description><![CDATA[问题-1： 
parallels desktop \Mac无法访问

原因您可能是由 Windows XP、Windows Vista 或 Windows 7 升级到该系统但是没有选择迁移您的应用程序：可能无法迁移此配置的 Parallels Tools 。  
解决方案在该虚拟机中安装 Parallels Tools：


启动 虚拟机 
点击 虚拟机 菜单 ► 安装 Parallels Too...]]></description><category></category></item><item><title><![CDATA[LeetCode-8：String to Integer (atoi)]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/81107824</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/81107824</guid><author>developer1024</author><pubDate>Thu, 19 Jul 2018 00:08:53 +0800</pubDate><description><![CDATA[String to Integer (atoi). 字符串转整数 (atoi).



一、题目

Implement atoi which converts a string to an integer.

The function first discards as many whitespace characters as necessary until the first non-whit...]]></description><category></category></item><item><title><![CDATA[LeetCode-7：Reverse Integer]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/81090673</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/81090673</guid><author>developer1024</author><pubDate>Wed, 18 Jul 2018 00:06:06 +0800</pubDate><description><![CDATA[Reverse Integer. 反转整数.



一、题目

Given a 32-bit signed integer, reverse digits of an integer.

Example 1:


  Input: 123
  
  Output: 321


Example 2:


  Input: -123
  
  Output: -321


Example 3:


 ...]]></description><category></category></item><item><title><![CDATA[LeetCode-6：ZigZag Conversion.]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/81090573</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/81090573</guid><author>developer1024</author><pubDate>Tue, 17 Jul 2018 23:58:35 +0800</pubDate><description><![CDATA[Longest Palindromic Substring. 最长回文子串.



一、题目

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example 1:


  Input: “babad” 
  Ou...]]></description><category></category></item><item><title><![CDATA[知识库、资源收集整理]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/81074210</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/81074210</guid><author>developer1024</author><pubDate>Tue, 17 Jul 2018 00:47:05 +0800</pubDate><description><![CDATA[一、编程语言/开发平台相关

【C/C++】

C++知识库、资源收集整理

【Java】

（待更新。。。）

【Android】

（待更新。。。）

【ios】

（待更新。。。）





二、算法相关

排序算法详解





三、面试相关

leetcode题解...]]></description><category></category></item><item><title><![CDATA[LeetCode-5：Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/81039111</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/81039111</guid><author>developer1024</author><pubDate>Sat, 14 Jul 2018 00:00:08 +0800</pubDate><description><![CDATA[Longest Palindromic Substring. 最长回文子串.



一、题目

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example 1:


  Input: “babad”
  
  ...]]></description><category></category></item><item><title><![CDATA[tolua笔记《05》- 访问Lua脚本变量]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/80063984</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/80063984</guid><author>developer1024</author><pubDate>Tue, 24 Apr 2018 14:19:17 +0800</pubDate><description><![CDATA[在前面tolua笔记《04》- Lua Function调用中已经介绍了C#如何调用Lua Function,本篇中我们进一步通过04_AccessingLuaVariables示例了解如何访问Lua脚本中的变量。

演示效果







示例代码



using UnityEngine;
using System.Collections.Generic;
using LuaInterface...]]></description><category></category></item><item><title><![CDATA[tolua笔记《04》- Lua Function调用]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/80060842</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/80060842</guid><author>developer1024</author><pubDate>Tue, 24 Apr 2018 10:28:41 +0800</pubDate><description><![CDATA[在前面几篇中已经介绍了C#如何调用Lua脚本,本篇中我们进一步通过**03_CallLuaFunction**s示例进一步了解Lua脚本中的Function是如何调用的。



演示效果





示例代码



using UnityEngine;
using System.Collections;
using LuaInterface;
using System;

public class ...]]></description><category></category></item><item><title><![CDATA[tolua笔记《03》- C#读取调用Lua脚本文件]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/80030032</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/80030032</guid><author>developer1024</author><pubDate>Sat, 21 Apr 2018 15:19:55 +0800</pubDate><description><![CDATA[在前面一篇tolua笔记《02》- C#调用lua脚本展示了C#如何调用Lua脚本,但示例通过一个string字符串保存的简单的Lua脚本。而实际项目中,Lua脚本要比这复杂的多,通常也都保存在单独的脚本文件中供调用。



示例代码

ScriptsFromFile.lua脚本文件：



print(&quot;This is a script from a utf8 file&quot;)
print(&quot;tol...]]></description><category></category></item><item><title><![CDATA[tolua笔记《02》- lua脚本的简单调用]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/80027561</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/80027561</guid><author>developer1024</author><pubDate>Sat, 21 Apr 2018 11:22:50 +0800</pubDate><description><![CDATA[在前一篇tolua笔记《01》- 安装使用入门中已经对tolua有了初步了解，接下来我们就结合tolua中的Examples示例进一步深入学习。 
tolua中Examples目录下提供了二十多个示例，如下图所示： 


本篇中我们以Example中的01_HelloWorld为例，来了解C#如何调用lua脚本。





脚本绑定

在unity3d编辑器中，我们选中Hierarchy面板中选中...]]></description><category></category></item><item><title><![CDATA[tolua笔记《01》- 安装使用入门]]></title><link>https://blog.youkuaiyun.com/developer1024/article/details/80026946</link><guid>https://blog.youkuaiyun.com/developer1024/article/details/80026946</guid><author>developer1024</author><pubDate>Sat, 21 Apr 2018 10:27:45 +0800</pubDate><description><![CDATA[一、tolua简介

tolua#是Unity静态绑定lua的一个解决方案，它通过C#提供的反射信息分析代码并生成包装的类。它是一个用来简化在C#中集成lua的插件，可以自动生成用于在lua中访问Unity的绑定代码，并把C#中的常量、变量、函数、属性、类以及枚举暴露给lua。它是从cstolua衍变而来。从它的名字可以看出，它是集成了原来的tolua代码通过二次封装写了一个C#与tolua(c)...]]></description><category></category></item></channel></rss>