Globalization

asdf2014 · asdf2014 · commit cb895a9520c7 · 2021-06-15T12:48:21.000+08:00
diff --git a/.github/workflows/main.yml b/.github/workflows/main.yml
@@ -39,7 +39,7 @@ jobs:
           author_name: asdf2014
           author_email: asdf2014@apache.org
           message: "[Code Formatter & Update Leaderboard] by 🤖"
-          path: "Codes README.md README-en.md .idea/dictionaries/yuzhouwan.xml"
+          path: "Codes README.md README-zh.md .idea/dictionaries/yuzhouwan.xml"
           pattern: "*.*"
           force: true
         env:
diff --git a/.github/workflows/picker.yml b/.github/workflows/picker.yml
@@ -30,7 +30,7 @@ jobs:
           author_name: asdf2014
           author_email: asdf2014@apache.org
           message: "[Choose a Question Randomly] by 🤖"
-          path: "Picker README.md README-en.md"
+          path: "Picker README.md README-zh.md"
           pattern: "*.*"
           force: true
         env:
diff --git a/Picker/random_picker.py b/Picker/random_picker.py
@@ -63,11 +63,14 @@ def flush_readme(readme_file, url, date_comment, local):
 
 # flush README
 flush_readme(
-    "README.md", "https://leetcode-cn.com/problems/", "🤖：最近一次更新时间为 `%s`。\n", True
-)
-flush_readme(
-    "README-en.md",
+    "README.md",
     "https://leetcode.com/problems/",
     "🤖: The last update time was `%s`.\n",
     False,
 )
+flush_readme(
+    "README-zh.md",
+    "https://leetcode-cn.com/problems/",
+    "🤖：最近一次更新时间为 `%s`。\n",
+    True
+)
diff --git a/README-zh.md b/README-zh.md
@@ -11,49 +11,48 @@
 [![](https://img.shields.io/badge/QQ%20Group-5366753-blue.svg?style=social&logo=tencent-qq)](https://shang.qq.com/wpa/qunwpa?idkey=bfbcf1453371a0810fd6be235ace47147f6fb9d262fb768b497c861f50af0af4)
 [![](https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod)](https://gitpod.io/#https://github.com/asdf2014/algorithm)
 
-[中文](https://github.com/asdf2014/algorithm/blob/master/README.md) | English
+[English](https://github.com/asdf2014/algorithm/blob/master/README.md) | 中文
 
-# Team up to solve problems on LeetCode together
+# Leetcode 组队刷题
 
-## Introduction
+## 介绍
 
-### Code repository
+### 代码仓库
 
-　The address of code repository is **[asdf2014 / algorithm](https://github.com/asdf2014/algorithm)**
+　代码仓库的坐标：**[asdf2014 / algorithm](https://github.com/asdf2014/algorithm)**
 
-### Way to sign up
+### 报名途径
 
-　Just leave a message in the comment area at the end of the "[Algorithm](https://yuzhouwan.github.io/posts/666/)" or in the [issues#40](https://github.com/asdf2014/gitment/issues/40), and you can participate at any time.
+　只需要在《[Algorithm](https://yuzhouwan.com/posts/666/)》文末的评论区，或者在 [issues#40](https://github.com/asdf2014/gitment/issues/40) 中留言，即可随时参与
 
-### Way to participate
+### 参与方式
 
-　Each participating partner will get the [Collaborator](https://help.github.com/en/github/setting-up-and-managing-your-github-user-account/permission-levels-for-a-user-account-repository) permission of the code repository, and can freely submit the code (unlimited language). In the `/Codes/${Your Github Account Name}`directory, each will have own code base. After leaving the Github name, you will receive an invitation immediately, you can claim it in this [link](https://github.com/asdf2014/algorithm/invitations).
+　每位参与的小伙伴，都会获得代码仓库的 [Collaborator](https://help.github.com/en/github/setting-up-and-managing-your-github-user-account/permission-levels-for-a-user-account-repository) 权限，可以自由地提交代码（不限制语种）。在 `/Codes/${你的 Github 账号名}` 目录下，每人都将拥有一个自己的代码库。留下 Github 名称后，将很快会收到邀请函，大家可以在 [asdf2014 - algorithm - invitations](https://github.com/asdf2014/algorithm/invitations) 链接中认领（当然，也欢迎直接通过提交 Pull Request 参与进来）
 
 ```bash
-# You can use the follow script to complete your first code submission for a quick start.
-# Of course, if you are familiar with Git commands, you can also submit the code yourself.
+# 一键完成您的第一次代码提交
 bash -c "$(curl -L https://raw.githubusercontent.com/asdf2014/algorithm/master/first_commit.sh)"
 ```
 
-### Frequency
+### 刷题频率
 
-　Considering that there may not be much leisure time for everyone, we tentatively set the frequency of completion as "once a week".
+　考虑到可能大家的闲暇时间并不多，我们暂定刷题频率为“一周一题”
 
-### Problem selection strategy
+### 选题策略
 
-　The [problem selection robot](https://github.com/asdf2014/algorithm/blob/master/Picker/random_picker.py) will automatically select a problem randomly at 12 noon every Friday. The current problem is as follow:
+　[选题机器人](https://github.com/asdf2014/algorithm/blob/master/Picker/random_picker.py)会在每周五晚八点，自动地随机选定一个题目，当前题目如下：
 
 | ID | Title |
 | :-: | :--: |
-| [565](https://leetcode.com/problems/array-nesting) | Array Nesting |
+| [565](https://leetcode-cn.com/problems/array-nesting) | Array Nesting |
 
-🤖: The last update time was `2021-06-11 12:03:19`.
+🤖：最近一次更新时间为 `2021-06-11 20:03:19`。
 
 <br/>
 
-## TopN
+## 排行榜
 
-### The most problem-solving partners
+### 完成题目最多的小伙伴
 
 | User | Completed |
 | :--: | :-------: |
@@ -68,35 +67,33 @@ bash -c "$(curl -L https://raw.githubusercontent.com/asdf2014/algorithm/master/f
 | [Buddy119](https://github.com/asdf2014/algorithm/tree/master/Codes/Buddy119) | 32 |
 | [asdf2014](https://github.com/asdf2014/algorithm/tree/master/Codes/asdf2014) | 31 |
 
-### The most active partners
+### 最活跃的小伙伴
 
 | User | Latest Active Date |
 | :--: | :----------------: |
-| **[madeai](https://github.com/asdf2014/algorithm/tree/master/Codes/madeai)** | 2021-06-13 08:09:06 |
-| **[yore](https://github.com/asdf2014/algorithm/tree/master/Codes/yore)** | 2021-05-19 01:40:25 |
-| **[ghoslation](https://github.com/asdf2014/algorithm/tree/master/Codes/ghoslation)** | 2021-04-18 13:22:42 |
-| [StarDrewer](https://github.com/asdf2014/algorithm/tree/master/Codes/StarDrewer) | 2021-03-18 10:43:42 |
-| [liyongquan](https://github.com/asdf2014/algorithm/tree/master/Codes/liyongquan) | 2021-03-04 10:39:23 |
-| [gracekoo](https://github.com/asdf2014/algorithm/tree/master/Codes/gracekoo) | 2021-02-28 16:48:31 |
-| [purebaba](https://github.com/asdf2014/algorithm/tree/master/Codes/purebaba) | 2021-02-26 01:15:47 |
-| [asdf2014](https://github.com/asdf2014/algorithm/tree/master/Codes/asdf2014) | 2021-02-18 14:37:56 |
-| [LittleCuteRabbit](https://github.com/asdf2014/algorithm/tree/master/Codes/LittleCuteRabbit) | 2021-01-12 05:32:48 |
-| [Terence.Sun](https://github.com/asdf2014/algorithm/tree/master/Codes/Terence.Sun) | 2020-12-30 09:48:56 |
-
-🤖: Updates to the leaderboards are automatically executed after submission.
+| **[madeai](https://github.com/asdf2014/algorithm/tree/master/Codes/madeai)** | 2021-06-13 16:09:06 |
+| **[yore](https://github.com/asdf2014/algorithm/tree/master/Codes/yore)** | 2021-05-19 09:40:25 |
+| **[ghoslation](https://github.com/asdf2014/algorithm/tree/master/Codes/ghoslation)** | 2021-04-18 21:22:42 |
+| [StarDrewer](https://github.com/asdf2014/algorithm/tree/master/Codes/StarDrewer) | 2021-03-18 18:43:42 |
+| [liyongquan](https://github.com/asdf2014/algorithm/tree/master/Codes/liyongquan) | 2021-03-04 18:39:23 |
+| [gracekoo](https://github.com/asdf2014/algorithm/tree/master/Codes/gracekoo) | 2021-03-01 00:48:31 |
+| [purebaba](https://github.com/asdf2014/algorithm/tree/master/Codes/purebaba) | 2021-02-26 09:15:47 |
+| [asdf2014](https://github.com/asdf2014/algorithm/tree/master/Codes/asdf2014) | 2021-02-18 22:37:56 |
+| [LittleCuteRabbit](https://github.com/asdf2014/algorithm/tree/master/Codes/LittleCuteRabbit) | 2021-01-12 13:32:48 |
+| [Terence.Sun](https://github.com/asdf2014/algorithm/tree/master/Codes/Terence.Sun) | 2020-12-30 17:48:56 |
+
+🤖：排行榜的更新会在提交后自动执行。
 
 <br/>
 
-## Original intention
+## 初衷
 
-　It is purely a public welfare project, and we call on everyone to study together, communicate with each other and make progress together.
+　纯属公益项目，号召大家一起刷题，互相交流，共同进步。
 
-## Thanks
+## 鸣谢
 
 [![](https://opencollective.com/algorithm/contributors.svg?width=666)](https://github.com/asdf2014/algorithm/graphs/contributors)
 
 ---
 
-For more details, please refer to "[Algorithm](https://yuzhouwan.com/posts/666/)". In addition, if you encounter problems related to Git, please refer to "[Git](https://yuzhouwan.com/posts/30041/)".
-
-
+更多内容，详见《[Algorithm](https://yuzhouwan.com/posts/666/)》。另外，如果遇到 Git 操作相关的问题，详见《[Git 高级玩法](https://yuzhouwan.com/posts/30041/)》。
diff --git a/README.md b/README.md
@@ -11,53 +11,49 @@
 [![](https://img.shields.io/badge/QQ%20Group-5366753-blue.svg?style=social&logo=tencent-qq)](https://shang.qq.com/wpa/qunwpa?idkey=bfbcf1453371a0810fd6be235ace47147f6fb9d262fb768b497c861f50af0af4)
 [![](https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod)](https://gitpod.io/#https://github.com/asdf2014/algorithm)
 
+English | [中文](https://github.com/asdf2014/algorithm/blob/master/README-zh.md)
 
-中文 | [English](https://github.com/asdf2014/algorithm/blob/master/README-en.md)
+# Team up to solve problems on LeetCode together
 
-# Leetcode 组队刷题
+## Introduction
 
-## 介绍
+### Code repository
 
-### 代码仓库
+　The address of code repository is **[asdf2014 / algorithm](https://github.com/asdf2014/algorithm)**
 
-　代码仓库的坐标：**[asdf2014 / algorithm](https://github.com/asdf2014/algorithm)**
+### Way to sign up
 
+　Just leave a message in the comment area at the end of the "[Algorithm](https://yuzhouwan.github.io/posts/666/)" or in the [issues#40](https://github.com/asdf2014/gitment/issues/40), and you can participate at any time.
 
-### 报名途径
+### Way to participate
 
-　只需要在《[Algorithm](https://yuzhouwan.com/posts/666/)》文末的评论区，或者在 [issues#40](https://github.com/asdf2014/gitment/issues/40) 中留言，即可随时参与
-
-
-### 参与方式
-
-　每位参与的小伙伴，都会获得代码仓库的 [Collaborator](https://help.github.com/en/github/setting-up-and-managing-your-github-user-account/permission-levels-for-a-user-account-repository) 权限，可以自由地提交代码（不限制语种）。在 `/Codes/${你的 Github 账号名}` 目录下，每人都将拥有一个自己的代码库。留下 Github 名称后，将很快会收到邀请函，大家可以在 [asdf2014 - algorithm - invitations](https://github.com/asdf2014/algorithm/invitations) 链接中认领（当然，也欢迎直接通过提交 Pull Request 参与进来）
+　Each participating partner will get the [Collaborator](https://help.github.com/en/github/setting-up-and-managing-your-github-user-account/permission-levels-for-a-user-account-repository) permission of the code repository, and can freely submit the code (unlimited language). In the `/Codes/${Your Github Account Name}`directory, each will have own code base. After leaving the Github name, you will receive an invitation immediately, you can claim it in this [link](https://github.com/asdf2014/algorithm/invitations).
 
 ```bash
-# 一键完成您的第一次代码提交
+# You can use the follow script to complete your first code submission for a quick start.
+# Of course, if you are familiar with Git commands, you can also submit the code yourself.
 bash -c "$(curl -L https://raw.githubusercontent.com/asdf2014/algorithm/master/first_commit.sh)"
 ```
 
+### Frequency
 
-### 刷题频率
-
-　考虑到可能大家的闲暇时间并不多，我们暂定刷题频率为“一周一题”
+　Considering that there may not be much leisure time for everyone, we tentatively set the frequency of completion as "once a week".
 
+### Problem selection strategy
 
-### 选题策略
-
-　[选题机器人](https://github.com/asdf2014/algorithm/blob/master/Picker/random_picker.py)会在每周五晚八点，自动地随机选定一个题目，当前题目如下：
+　The [problem selection robot](https://github.com/asdf2014/algorithm/blob/master/Picker/random_picker.py) will automatically select a problem randomly at 12 noon every Friday. The current problem is as follow:
 
 | ID | Title |
 | :-: | :--: |
-| [565](https://leetcode-cn.com/problems/array-nesting) | Array Nesting |
+| [565](https://leetcode.com/problems/array-nesting) | Array Nesting |
 
-🤖：最近一次更新时间为 `2021-06-11 20:03:19`。
+🤖: The last update time was `2021-06-11 12:03:19`.
 
 <br/>
 
-## 排行榜
+## TopN
 
-### 完成题目最多的小伙伴
+### The most problem-solving partners
 
 | User | Completed |
 | :--: | :-------: |
@@ -72,35 +68,33 @@ bash -c "$(curl -L https://raw.githubusercontent.com/asdf2014/algorithm/master/f
 | [Buddy119](https://github.com/asdf2014/algorithm/tree/master/Codes/Buddy119) | 32 |
 | [asdf2014](https://github.com/asdf2014/algorithm/tree/master/Codes/asdf2014) | 31 |
 
-### 最活跃的小伙伴
+### The most active partners
 
 | User | Latest Active Date |
 | :--: | :----------------: |
-| **[madeai](https://github.com/asdf2014/algorithm/tree/master/Codes/madeai)** | 2021-06-13 16:09:06 |
-| **[yore](https://github.com/asdf2014/algorithm/tree/master/Codes/yore)** | 2021-05-19 09:40:25 |
-| **[ghoslation](https://github.com/asdf2014/algorithm/tree/master/Codes/ghoslation)** | 2021-04-18 21:22:42 |
-| [StarDrewer](https://github.com/asdf2014/algorithm/tree/master/Codes/StarDrewer) | 2021-03-18 18:43:42 |
-| [liyongquan](https://github.com/asdf2014/algorithm/tree/master/Codes/liyongquan) | 2021-03-04 18:39:23 |
-| [gracekoo](https://github.com/asdf2014/algorithm/tree/master/Codes/gracekoo) | 2021-03-01 00:48:31 |
-| [purebaba](https://github.com/asdf2014/algorithm/tree/master/Codes/purebaba) | 2021-02-26 09:15:47 |
-| [asdf2014](https://github.com/asdf2014/algorithm/tree/master/Codes/asdf2014) | 2021-02-18 22:37:56 |
-| [LittleCuteRabbit](https://github.com/asdf2014/algorithm/tree/master/Codes/LittleCuteRabbit) | 2021-01-12 13:32:48 |
-| [Terence.Sun](https://github.com/asdf2014/algorithm/tree/master/Codes/Terence.Sun) | 2020-12-30 17:48:56 |
-
-🤖：排行榜的更新会在提交后自动执行。
+| **[madeai](https://github.com/asdf2014/algorithm/tree/master/Codes/madeai)** | 2021-06-13 08:09:06 |
+| **[yore](https://github.com/asdf2014/algorithm/tree/master/Codes/yore)** | 2021-05-19 01:40:25 |
+| **[ghoslation](https://github.com/asdf2014/algorithm/tree/master/Codes/ghoslation)** | 2021-04-18 13:22:42 |
+| [StarDrewer](https://github.com/asdf2014/algorithm/tree/master/Codes/StarDrewer) | 2021-03-18 10:43:42 |
+| [liyongquan](https://github.com/asdf2014/algorithm/tree/master/Codes/liyongquan) | 2021-03-04 10:39:23 |
+| [gracekoo](https://github.com/asdf2014/algorithm/tree/master/Codes/gracekoo) | 2021-02-28 16:48:31 |
+| [purebaba](https://github.com/asdf2014/algorithm/tree/master/Codes/purebaba) | 2021-02-26 01:15:47 |
+| [asdf2014](https://github.com/asdf2014/algorithm/tree/master/Codes/asdf2014) | 2021-02-18 14:37:56 |
+| [LittleCuteRabbit](https://github.com/asdf2014/algorithm/tree/master/Codes/LittleCuteRabbit) | 2021-01-12 05:32:48 |
+| [Terence.Sun](https://github.com/asdf2014/algorithm/tree/master/Codes/Terence.Sun) | 2020-12-30 09:48:56 |
+
+🤖: Updates to the leaderboards are automatically executed after submission.
 
 <br/>
 
-## 初衷
+## Original intention
 
-　纯属公益项目，号召大家一起刷题，互相交流，共同进步。
+　It is purely a public welfare project, and we call on everyone to study together, communicate with each other and make progress together.
 
-## 鸣谢
+## Thanks
 
 [![](https://opencollective.com/algorithm/contributors.svg?width=666)](https://github.com/asdf2014/algorithm/graphs/contributors)
 
-
 ---
 
-
-更多内容，详见《[Algorithm](https://yuzhouwan.com/posts/666/)》。另外，如果遇到 Git 操作相关的问题，详见《[Git 高级玩法](https://yuzhouwan.com/posts/30041/)》。
+For more details, please refer to "[Algorithm](https://yuzhouwan.com/posts/666/)". In addition, if you encounter problems related to Git, please refer to "[Git](https://yuzhouwan.com/posts/30041/)".
diff --git a/top.py b/top.py
@@ -139,5 +139,5 @@ def expand_dict():
 expand_dict()
 
 # flush README
-flush_readme("README.md", True)
-flush_readme("README-en.md", False)
+flush_readme("README.md", False)
+flush_readme("README-zh.md", True)
