二刷136

Author: diguage

docs/0136-single-number.adoc

@@ -25,11 +25,35 @@ Your algorithm should have a linear runtime complexity. Could you implement it w
 *Output:* 4
 ----
 
+== 思路分析
 
+只有一个数出现一次，其余数字出现两次，则可以用异或来找出该数。异或两位相异得 1，相同得 0，则出现两次的数字都全部得 0，留下了数字即为只出现一次的数字。
+
+image::images/0136-01.png[{image_attr}]
 
 [[src-0136]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0136_SingleNumber.java[tag=answer]
 ----
+--
+
+二刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0136_SingleNumber_2.java[tag=answer]
+----
+--
+====
+
+== 参考资料
+
+. https://leetcode.cn/problems/single-number/solutions/2361995/136-zhi-chu-xian-yi-ci-de-shu-zi-wei-yun-iyd0/?envType=study-plan-v2&envId=selected-coding-interview[136. 只出现一次的数字 - 位运算，清晰图解^]
 

docs/images/0136-01.png

@@ -722,6 +722,11 @@
 |{doc_base_url}/0179-largest-number.adoc[题解]
 |⭕️ 不能直接比较数字的字符串，要比较 `a+b` 和 `b+a`，这是拼接后的数字。
 
+|{counter:codes}
+|{leetcode_base_url}/single-number/[136. Single Number^]
+|{doc_base_url}/0136-single-number.adoc[题解]
+|✅ 位运算，异或
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

logbook/202406.adoc

@@ -31,11 +31,14 @@
  * @since 2020-01-01 12:38
  */
 public class _0136_SingleNumber {
-  // tag::answer[]
+    // tag::answer[]
     /**
      * Runtime: 0 ms, faster than 100.00% of Java online submissions for Single Number.
      *
      * Memory Usage: 38.5 MB, less than 98.52% of Java online submissions for Single Number.
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-01-01 12:38
      */
     public int singleNumber(int[] nums) {
         if (Objects.isNull(nums) || nums.length == 0) {

src/main/java/com/diguage/algo/leetcode/_0136_SingleNumber.java

@@ -0,0 +1,17 @@
+package com.diguage.algo.leetcode;
+
+public class _0136_SingleNumber_2 {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-19 14:48:40
+   */
+  public int singleNumber(int[] nums) {
+    int result = 0;
+    for (int num : nums) {
+      result ^= num;
+    }
+    return result;
+  }
+  // end::answer[]
+}