<?xml version="1.0" encoding="utf-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"><channel><title>MagicLen</title><link>https://magiclen.org/cn/tag/java/</link><description>多元化原创文章，内容包罗万象，有编程语言、网站应用、软件介绍、硬件介绍、操作系统、旅行游记、专题采访、益智问题、文学创作，以及作者们的知识分享和作品分享。</description><language>zh-CN</language><lastBuildDate>Sun, 22 Nov 2026 18:48:26 +0800</lastBuildDate><atom:link href="https://magiclen.org/cn/tag/java/feed/" rel="self" type="application/rss+xml"/><sy:updatePeriod>hourly</sy:updatePeriod><sy:updateFrequency>8</sy:updateFrequency><sy:updateBase>1970-01-01T00:00+00:00</sy:updateBase><item><title>在 Java 和 JavaScript 中，字符串的字数就等于字符数量吗？错！</title><link>https://magiclen.org/cn/java-count-characters/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2022/12/font-4646566_1920-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2022/12/font-4646566_1920-220x162.png 1x, https://magiclen.org/wp-content/uploads/2022/12/font-4646566_1920-440x324.png 2x, https://magiclen.org/wp-content/uploads/2022/12/font-4646566_1920-660x486.png 3x" alt>
在 Java 和 JavaScript 中，我们经常会使用字符串(String)提供的「length」成员(member)来抓取这个字符串的字数。由于 Java 和 JavaScript 并不像 Rust 或是 Golang 编程语言这样会直接抓到字符串在经过编码之后的字节数量，而是会得到字符的数量，所以我们很直觉地就会在 Java 或 JavaScript 用这样的方式来计算字符串的字数。]]></description><category>研究分享</category><category>Java</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>TypeScript</category><category>烂 Code</category><guid>https://magiclen.org/cn/java-count-characters</guid><pubDate>Tue, 13 Dec 2022 12:00:00 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>写程序算阶乘，关于阶乘的三两事</title><link>https://magiclen.org/cn/factorial/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2022/08/factorial-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2022/08/factorial-220x162.png 1x, https://magiclen.org/wp-content/uploads/2022/08/factorial-440x324.png 2x, https://magiclen.org/wp-content/uploads/2022/08/factorial-660x486.png 3x" alt>
正整数的阶乘(Factorial)是小于或等于该数的所有正整数的乘积，若正整数为 N，用 N! 来表示 N 的阶乘。至于 0! 是阶乘的特例，它被定义为 1。阶乘的运算具有递归(recursion)概念，常作为学习程序逻辑的材料，而这篇文章将会说明阶乘相关的程序计算。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>数学逻辑</category><category>Rust</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>TypeScript</category><category>阶乘</category><category>Go</category><guid>https://magiclen.org/cn/factorial</guid><pubDate>Thu, 27 Oct 2022 12:00:00 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>如何写程序来做等值的货币或是物品的数量换算？</title><link>https://magiclen.org/cn/item-exchange/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2022/06/business-18107_1920-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2022/06/business-18107_1920-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2022/06/business-18107_1920-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2022/06/business-18107_1920-660x486.jpg 3x" alt>
不同国家有不同的货币流通，不同的货币也会有不同的价值。其实也不只货币，任何物品，无论实体的或是虚拟的都一样，只要价值可以被衡量，就可以被等值换算。讲到钱就伤感情，以苹果和橘子来举例好了，假设 2 颗苹果等值于 3 粒橘子，那么 8 颗苹果就会等值于 12 粒橘子。]]></description><category>研究分享</category><category>Java</category><category>数学逻辑</category><category>Rust</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>TypeScript</category><guid>https://magiclen.org/cn/item-exchange</guid><pubDate>Thu, 28 Jul 2022 12:00:00 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>如何判断两个浮点数是否相等？是否能整除？相除后余数是多少？</title><link>https://magiclen.org/cn/float-precision/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2022/06/geometry-1044090_1920-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2022/06/geometry-1044090_1920-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2022/06/geometry-1044090_1920-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2022/06/geometry-1044090_1920-660x486.jpg 3x" alt>
使用电脑去进行浮点数运算的时候，在某些条件下会出现显而易见的误差，而这样的误差，就会导致与浮点数有关的计算或是逻辑判断出现问题。]]></description><category>研究分享</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>TypeScript</category><guid>https://magiclen.org/cn/float-precision</guid><pubDate>Thu, 21 Jul 2022 12:00:00 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>用动态规划解决问题：零壹背包问题(0/1 Knapsack Problem)</title><link>https://magiclen.org/cn/dynamic-programming-0-1-knapsack-problem/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-660x486.jpg 3x" alt>
一个背着背包的小偷闯空门偷东西，他必须趁屋主回来之前把有价值的物品塞进包包内带走。考虑到小偷自身的行动力，背包能装的物品总重量有限，小偷要如何选择物品才能获得最高的总价值？]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>TypeScript</category><category>动态规划</category><category>Go</category><guid>https://magiclen.org/cn/dynamic-programming-0-1-knapsack-problem</guid><pubDate>Tue, 4 Aug 2020 12:00:41 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>用动态规划解决问题：找零钱问题(Coin Change Problem)</title><link>https://magiclen.org/cn/dynamic-programming-coin-change/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-660x486.jpg 3x" alt>
许多人认为身上如果带太多的零钱会让行动变得不方便，因此会希望商店店员在找零钱的时候能够以最少的硬币数来找，而不是全部都用 1 元塞给我们。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>TypeScript</category><category>动态规划</category><category>Go</category><guid>https://magiclen.org/cn/dynamic-programming-coin-change</guid><pubDate>Tue, 28 Jul 2020 12:00:30 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>用动态规划解决问题：基本观念（有重叠子问题的问题）</title><link>https://magiclen.org/cn/dynamic-programming-basic/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-660x486.jpg 3x" alt>
动态规划（Dynamic Programming，简称 DP）是一种解决问题的技巧，主要被用来优化那些「记不住自己过去曾解出来的答案所以只好重复再解」的算法，让它们可以「记忆」已经找出来的答案，从而不断利用，以大大降低时间复杂度（从指数级降到线性）。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>TypeScript</category><category>费氏数列</category><category>动态规划</category><category>Go</category><guid>https://magiclen.org/cn/dynamic-programming-basic</guid><pubDate>Tue, 21 Jul 2020 12:00:16 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>认识数字系统，进行任意进制的超长整数运算（加、减、乘、除）</title><link>https://magiclen.org/cn/numeral-system-big-integer/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2020/05/big-number-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2020/05/big-number-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2020/05/big-number-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2020/05/big-number-660x486.jpg 3x" alt>
电脑程序在进行整数数值计算的时候，会受到变量类型的内存空间使用大小而有数值表示范围的限制，所以当遇到过长的数值时，就无法正常地运算出结果。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>数学逻辑</category><category>Rust</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>大数运算</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/numeral-system-big-integer</guid><pubDate>Tue, 14 Jul 2020 12:00:42 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>如何用程序进行质因数分解和寻找最大公因数与最小公倍数？</title><link>https://magiclen.org/cn/prime-factorization-gcd-lcm/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2018/10/pay-819587_1920-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2018/10/pay-819587_1920-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2018/10/pay-819587_1920-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2018/10/pay-819587_1920-660x486.jpg 3x" alt>
若正整数 a 除以正整数 b 可以整除，则称 b 为 a 的因数(Factor)，a 为 b 的倍数(Multiple)，1 是所有正整数最小的因数，任意正整数最大的因数就是该正整数本身。若 a 同时是 x 和 y 的因数，则称 a 是 x 和 y 的公因数(Common Divisor)，如果 a 是 x 和 y 的公因数中最大的一个，则称 a 是 x 和 y 的最大公因数（Greatest C...]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>数学逻辑</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>TypeScript</category><category>质因数分解</category><category>最大公因数</category><category>最小公倍数</category><category>辗转相除法</category><category>Go</category><guid>https://magiclen.org/cn/prime-factorization-gcd-lcm</guid><pubDate>Thu, 9 Jul 2020 12:00:35 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>如何写程序来找出河内塔的最佳解？那不写程序的话呢？</title><link>https://magiclen.org/cn/tower-of-hanoi/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2020/04/Untitled-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2020/04/Untitled-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2020/04/Untitled-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2020/04/Untitled-660x486.jpg 3x" alt>
河内塔(Tower of Hanoi)是一个很谜的数学游戏，它是由三根杆子(Rod)和一个以上大小不同的盘片(Disk)所组成的。在游戏的一开始，这些盘片按照底大顶小的顺序叠在一起，由三根杆子中的其中一根串着。玩家每次可以移动一个盘片到其它的杆子上，但是不能将比较大的盘片叠在比较小的盘片上。当玩家把所有盘片都串到指定的杆子，游戏就结束了。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>数学逻辑</category><category>Rust</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>TypeScript</category><category>河内塔</category><category>Go</category><guid>https://magiclen.org/cn/tower-of-hanoi</guid><pubDate>Thu, 25 Jun 2020 20:00:28 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>