重新用ChatGPT写一个生成小学生口算练习题的web页面

Posted on 2023-04-27 by aspirer

几年前自己用Python写过一个小学生100以内的口算练习题生成的web页面：生成口算练习题web服务

其实不需要搞这么复杂，而且没有写好html和css，导致居中都没有，也不能调整字体大小，也没有刷新重新生成的按钮，总之很挫很挫。

根本原因就是我不会写前端代码。。。

现在有了ChatGPT，就尝试让他写一个纯web的练习题生成页面，我只给了他4次提示，他就做到了：

100以内加减法口算练习题生成web页面

下面是交流过程：

prompt1：帮我写一个web页面，要求是可以通过一个按钮随机一个低年级小学生练习100以内加减法口算的习题集，每次生成100道题，每行4道题，共25行，并且要求居中显示，字体大小可以调节，方便A4纸打印。

ChatGPT：生成了一堆代码，包括html、css、js（因为代码量比较多，所以他中断之后要告诉ChatGPT继续写）

我试着整理之后跑了下，报了2个错误，我又问了两个问题：

prompt2：这个网页点生成习题集按钮后报错：Uncaught TypeError TypeError: Cannot set properties of null (setting ‘innerHTML’)，怎么解决？

prompt3：调整字体报错：Uncaught TypeError TypeError: Cannot read properties of null (reading ‘value’)，怎么解决？

prompt4：对于小学生来说，减法口算不应该出现负数，另外100以内的加法结果也不能超过100，需要修改下代码。

这样几次交流，就生成了一个非常符合我预期的口算练习题生成web页面了，还是非常给力的。

技术

基于ChatGPT的code review机器人试用体验

Posted on 2023-03-03 by aspirer

经组内同学孙中夏推荐，今天在Curve代码库试用了一个基于ChatGPT的代码review机器人，github地址：https://github.com/anc95/ChatGPT-CodeReview

具体的执行流程和算法原理我没研究，应该也研究不明白，这里就讲讲怎么在GitHub仓库上配置这个bot，以及实际的review效果如何。

ps. OpenAI的key是杭研AI团队提供的，感谢支持~

部署配置

参考https://github.com/anc95/ChatGPT-CodeReview#usage这里的描述即可：

安装这个bot的GitHub APP
安装好之后，在这个APP页面点“Configure”
选择你要应用到的账号及代码仓库，注意你要有代码库的管理员权限
之后进入到代码库的主页，进入“Settings”标签
进入“Secrets and variables” — “Actions”
注意切换到“variables” tab项，再点“New repository variable”
填入name和value，name是“OPENAI_API_KEY”，value就是openai的key了

ps. 我用的是GitHub app方案，不是GitHub action，试了action方案没跑起来，有懂行的可以给点指导。

试用效果

尝试创建一个pull request，比如：

Curve代码库（C++语言）：https://github.com/aspirer/curve/pull/3
CurveAdm代码库（golang语言）：https://github.com/aspirer/curveadm/pull/1

PR创建完成后，稍等片刻，就可以看到cr-bot开始review代码了。

单就review效率来说，比人工评审代码要快太多倍了，我上面两个提交都是直接从一个分支合并到另外一个，代码改动量很大，但是cr-bot还是几分钟就搞定了，人工的话估计得好几天还不一定review的很细致。

review效果感受

大家可以自行去查看上面两个测试PR的review效果，我这里截图几个我觉得有代表意义的代码review结果。

https://github.com/opencurve/curveadm/pull/191/files

上面这个pr，是我去年提交的（golang我只看过基本语法，第一次写实际代码，所以请忽略我粗鄙的编码），这次重新提交一下看看ChatGPT code review bot的效果，可以看出，他指出了我代码里很多问题，其中第3条，是有一个外部curve用户实际遇到过的偶发问题（执行命令卡很久才返回），我自己怎么测都跑不出来，用户那边几乎必现，后来还是组内golang高手小伙伴重构了这段代码才解决。其他几点问题也都是非常有参考价值的。

https://github.com/aspirer/curveadm/pull/1/files#r1123991358

这个评审意见不需要解释，还是比较有效的。

https://github.com/aspirer/curve/pull/3/files#r1124018613

配置项也能review：

https://github.com/aspirer/curve/pull/3/files#r1124017844

增加简单功能的commit可以理解代码意图，这一点还是很不错的。

总体来说，还是有不少帮助作用的，至少可以让人工评审节省不少时间，比如bot可以辅助解释新提交代码的作用，指出常见错误，给出改进建议等。

如果配合ChatGPT的交流窗口，把有问题的代码片段再次单独交给他评审，可能会有更多的收获：

更多细节可以翻阅上面给到的两个测试PR的review记录。

不足之处

多次提交同样的代码，每次给出的review结果是不相同的，可能某次的评审建议是相对更合理且全面的，其他的几次不一定，或许需要多给他review几次，然后再综合几次的评审意见进行代码评估
无法完整的理解某个大的功能特性的设计方案和实现思路，打个形象的比方，就是组内A同学从来没有参加过功能点X的方案设计和评审工作（主要由B同学负责），然后让A同学直接去review B同学提交的代码，就有类似的效果，只能理解函数或代码片段，没有全局意识
个别review建议可能不一定正确，需要再进行人工判断，这一点也类似人工review，代码评审人提的建议也不一定是正确的
太长的新增的源文件，好像会无法评审
如果没有别的建议，bot会给出一堆通用建议，比如增加UT用例、lint检查、注释、log等等，这一点其实也不能说是不足吧

技术

使用Python+selenium抓取职位和公司信息

Posted on 2023-02-28 by aspirer

做这个事情的目的是，想看下全国和江浙沪宁，招聘ceph、块存储相关职位的公司有哪些，再分析下其中哪些公司可以尝试联系起来，看看是否有兴趣用curve。

一开始想着用requests或者更专业的scrapy写爬虫脚本，但是试了requests库之后，发现啥也抓不到，被网站反爬虫了。。。

只能试着用selenium来弄，好几年没用它了，有点生了，折腾了大半天才算能凑合用。

selenium需要自己pip安装，chromedriver需要自己下载：https://sites.google.com/chromium.org/driver/home

import time
from selenium import webdriver
from selenium.webdriver.common.by import By

# 职位关键词
JOB = "块存储"

# 保存的文件名
file_name = "companys-%s.csv" % JOB
csv = open(file_name, 'w+')
csv.write('职位名称,公司名称,公司类型,融资情况,公司规模\n')  # 标题栏

# Create an instance of Chrome WebDriver
browser = webdriver.Chrome('./chromedriver')

'''  地区编码：
全国:410
上海:020
杭州:070020
苏州:060080
南京:060020
'''
CITYS = ["410", "020", "070020", "060080", "060020"]
PAGES = 10  # 最多抓取几页内容，貌似猎聘默认最多10页
WAIT_PAGE_SEC = 5  # 等待网页刷新完成时间，其实还有一个函数可以用来检查页面是否刷新完毕，懒得改了

for CITY in CITYS:
    URL = 'https://www.liepin.com/zhaopin/?city=%s&dq=%s&pubTime=&currentPage=0&pageSize=40&key=%s' % (CITY, CITY, JOB)
    browser.get(URL)

    count = 0
    while (count < PAGES):
        count += 1
        time.sleep(WAIT_PAGE_SEC)

        job_list = browser.find_element(By.CLASS_NAME, "job-list-box")
        job_titles = job_list.find_elements(By.CLASS_NAME, "job-title-box")  # 职位标题
        titles = [j.text.replace('\n', '') for j in job_titles]
        com_info_box = job_list.find_elements(By.CLASS_NAME, "job-company-info-box") # 公司信息列表
        i = 0
        for com in com_info_box:  # 遍历公司列表
            com_name = com.find_element(By.CLASS_NAME, "company-name").text  # 公司名称
            com_tags = com.find_elements(By.CLASS_NAME, "company-tags-box")  # 公司标签

            tags = com_tags[0].find_elements(By.TAG_NAME, 'span')
            com_tag = [tag.text for tag in tags]
            if len(com_tag) == 3:   # 有无融资情况标签
                line = ','.join(com_tag)
            else:
                line = ', ,'.join(com_tag)

            line = titles[i] + ',' + com_name + ',' + line + '\n'  # 一条完整的公司信息
            i += 1

            csv.write(line)  # 保存到文件

        button = browser.find_elements(By.CLASS_NAME, "ant-pagination-item-link")[-1]
        if button.is_enabled():  # 是否可以点下一页，也就是是否职位已经展示完了
            button.click()
        else:
            print("该区域所有职位已遍历完！\n")
            break

csv.close()
browser.quit()
print("正常结束！\n")

import time

from selenium import webdriver

from selenium.webdriver.common.by import By

# 职位关键词

JOB = "块存储"

# 保存的文件名

file_name = "companys-%s.csv" % JOB

csv = open(file_name, 'w+')

csv.write('职位名称,公司名称,公司类型,融资情况,公司规模\n') # 标题栏

# Create an instance of Chrome WebDriver

browser = webdriver.Chrome('./chromedriver')

''' 地区编码：

全国:410

上海:020

杭州:070020

苏州:060080

南京:060020

'''

CITYS = ["410", "020", "070020", "060080", "060020"]

PAGES = 10 # 最多抓取几页内容，貌似猎聘默认最多10页

WAIT_PAGE_SEC = 5 # 等待网页刷新完成时间，其实还有一个函数可以用来检查页面是否刷新完毕，懒得改了

for CITY in CITYS:

URL = 'https://www.liepin.com/zhaopin/?city=%s&dq=%s&pubTime=&currentPage=0&pageSize=40&key=%s' % (CITY, CITY, JOB)

browser.get(URL)

count = 0

while (count < PAGES):

count += 1

time.sleep(WAIT_PAGE_SEC)

job_list = browser.find_element(By.CLASS_NAME, "job-list-box")

job_titles = job_list.find_elements(By.CLASS_NAME, "job-title-box") # 职位标题

titles = [j.text.replace('\n', '') for j in job_titles]

com_info_box = job_list.find_elements(By.CLASS_NAME, "job-company-info-box") # 公司信息列表

i = 0

for com in com_info_box: # 遍历公司列表

com_name = com.find_element(By.CLASS_NAME, "company-name").text # 公司名称

com_tags = com.find_elements(By.CLASS_NAME, "company-tags-box") # 公司标签

tags = com_tags[0].find_elements(By.TAG_NAME, 'span')

com_tag = [tag.text for tag in tags]

if len(com_tag) == 3: # 有无融资情况标签

line = ','.join(com_tag)

else:

line = ', ,'.join(com_tag)

line = titles[i] + ',' + com_name + ',' + line + '\n' # 一条完整的公司信息

i += 1

csv.write(line) # 保存到文件

button = browser.find_elements(By.CLASS_NAME, "ant-pagination-item-link")[-1]

if button.is_enabled(): # 是否可以点下一页，也就是是否职位已经展示完了

button.click()

else:

print("该区域所有职位已遍历完！\n")

break

csv.close()

browser.quit()

print("正常结束！\n")

输出结果大概长这样：

职位名称,公司名称,公司类型,融资情况,公司规模
Ceph专家【北京-海淀区】,浪潮云服务,IT服务, ,2000-5000人
ceph运维工程师【深圳】,云天畅想,云计算/大数据,C轮,100-499人
ceph存储研发工程师/专家【上海】,头部云厂商,互联网/电商, ,5000-10000人
Ceph研发工程师【深圳】,中盛瑞达,计算机软件,融资未公开,100-499人
ceph分布式存储研发工程师【深圳】,云天畅想,云计算/大数据,C轮,100-499人

职位名称,公司名称,公司类型,融资情况,公司规模

Ceph专家【北京-海淀区】,浪潮云服务,IT服务, ,2000-5000人

ceph运维工程师【深圳】,云天畅想,云计算/大数据,C轮,100-499人

ceph存储研发工程师/专家【上海】,头部云厂商,互联网/电商, ,5000-10000人

Ceph研发工程师【深圳】,中盛瑞达,计算机软件,融资未公开,100-499人

ceph分布式存储研发工程师【深圳】,云天畅想,云计算/大数据,C轮,100-499人

技术

本博客访问域名开启HTTPS

Posted on 2022-12-15 by aspirer

使用certbot进行免费域名SSL证书的申请和更新。

因为我的os版本比较低，所以是用snap进行安装，高版本的Ubuntu系统可以直接apt install certbot就能安装了。

apt install  snapd
snap install certbot
snap install --classic certbot
/snap/bin/certbot 
ln -s /snap/bin/certbot /usr/bin/certbot
which certbot 
certbot --nginx  # 生成证书并更新到Nginx配置文件
less /etc/nginx/sites-enabled/default  # 检查是否生成了ssl相关配置，可以搜索Certbot关键字

apt install snapd

snap install certbot

snap install --classic certbot

/snap/bin/certbot

ln -s /snap/bin/certbot /usr/bin/certbot

which certbot

certbot --nginx # 生成证书并更新到Nginx配置文件

less /etc/nginx/sites-enabled/default # 检查是否生成了ssl相关配置，可以搜索Certbot关键字

最后配置定时任务crontab，定期执行certbot renew操作即可定期更新域名证书。

然后就可以使用https访问域名了，http也会默认跳转到https。

技术

100. 相同的树

Posted on 2022-11-21 by aspirer

题目链接：https://leetcode.cn/problems/same-tree/

自己写了一个，用递归遍历，同步记录遍历的节点到vector，空节点用比较大的负数表示，但是会重复遍历一些子节点（虽然也能正确判断两棵树是否相同）。下面这个是官方答案。另外我也尝试用循环遍历，但是记错了，用了stack，而不是queue。空了试下queue。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:

    bool isSameTree(TreeNode* p, TreeNode* q) {
        if (p == nullptr && q == nullptr) {
            return true;
        } else if (p != nullptr && q != nullptr) {
            if (p->val != q->val) {
                return false;
            } else {
                return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
            }
        } else {
            return false;
        } 
    }
};

/**

* Definition for a binary tree node.

* struct TreeNode {

* int val;

* TreeNode *left;

* TreeNode *right;

* TreeNode() : val(0), left(nullptr), right(nullptr) {}

* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}

* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}

* };

class Solution {

public:

bool isSameTree(TreeNode* p, TreeNode* q) {

if (p == nullptr && q == nullptr) {

return true;

} else if (p != nullptr && q != nullptr) {

if (p->val != q->val) {

return false;

} else {

return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);

}

} else {

return false;

}

};

技术

98. 验证二叉搜索树

Posted on 2022-11-17 by aspirer

题目链接：https://leetcode.cn/problems/validate-binary-search-tree/

没能把中序遍历和搜索二叉树联系起来，看的评论区题解。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    long long  pre = (long long)INT_MIN - 1;
    bool middle_first(TreeNode* root) {
        if (!root) {
            return true;
        }
        bool l, r;
        l = middle_first(root->left);
        
        if (pre >= root->val) {
            return false;
        }
        pre = root->val;
        cout << root->val << ", ";
        r = middle_first(root->right);

        return l & r;
    }

    bool isValidBST(TreeNode* root) {
        if (!root) {
            return true;
        }
        return middle_first(root);

    }
};

/**

* Definition for a binary tree node.

* struct TreeNode {

* int val;

* TreeNode *left;

* TreeNode *right;

* TreeNode() : val(0), left(nullptr), right(nullptr) {}

* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}

* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}

* };

class Solution {

public:

long long pre = (long long)INT_MIN - 1;

bool middle_first(TreeNode* root) {

if (!root) {

return true;

}

bool l, r;

l = middle_first(root->left);

if (pre >= root->val) {

return false;

}

pre = root->val;

cout << root->val << ", ";

r = middle_first(root->right);

return l & r;

}

bool isValidBST(TreeNode* root) {

if (!root) {

return true;

}

return middle_first(root);

}

};

生活

谁是最亲近的人？

Posted on 2022-11-11 by aspirer

记不清从啥时候开始，只有我老婆记得我的生日。农历生日，真是记不住，连我自己也都不知道农历是什么日子。

犹记得18周岁生日那天在大学宿舍听收音机（是的，收音机，暴露年龄了），广播里的主播说今天是光棍节（11.11，也就是现在的双11），那是我第一次知道还有光棍节这个说法，本来以为4个1，好兆头啊。当时也正被感情困扰（不过单相思罢了），以为这辈子就是光棍命了。

幸好老天眷顾，在研究生快毕业的时候遇到了现在的老婆，还算顺利的过了11年。这几年聚少离多，但感情还算不错，日子也能过得下去（除了俩儿子有点气人）。

希望以后的日子全家人也平平安安，健健康康，顺顺利利。

我老婆常说，孩子长大了就不是自己的了，是他们自己一家子的，只有夫妻才是同路人。

技术

95. 不同的二叉搜索树 II

Posted on 2022-11-10 by aspirer

题目链接：https://leetcode.cn/problems/unique-binary-search-trees-ii/

这题不会，直接看的题解。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<TreeNode*> genTrees(int start, int end) {
        if (start > end) {
            return { nullptr };
        }
        vector<TreeNode*> res;
        for (int i = start; i <= end; i++) {
            vector<TreeNode*> leftTrees = genTrees(start, i - 1);
            vector<TreeNode*> rightTrees = genTrees(i + 1, end);

            for (auto &left : leftTrees) {
                for (auto &right : rightTrees) {
                    TreeNode* root = new TreeNode(i);
                    root->left = left;
                    root->right = right;
                    res.emplace_back(root);
                }
            }
        }
        return res;
    }

    vector<TreeNode*> generateTrees(int n) {
        if (n <= 0) {
            return {};
        }
        return genTrees(1, n);
    }
};

/**

* Definition for a binary tree node.

* struct TreeNode {

* int val;

* TreeNode *left;

* TreeNode *right;

* TreeNode() : val(0), left(nullptr), right(nullptr) {}

* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}

* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}

* };

class Solution {

public:

vector<TreeNode*> genTrees(int start, int end) {

if (start > end) {

return { nullptr };

}

vector<TreeNode*> res;

for (int i = start; i <= end; i++) {

vector<TreeNode*> leftTrees = genTrees(start, i - 1);

vector<TreeNode*> rightTrees = genTrees(i + 1, end);

for (auto &left : leftTrees) {

for (auto &right : rightTrees) {

TreeNode* root = new TreeNode(i);

root->left = left;

root->right = right;

res.emplace_back(root);

}

return res;

}

vector<TreeNode*> generateTrees(int n) {

if (n <= 0) {

return {};

}

return genTrees(1, n);

}

};

技术

立个flag

Posted on 2022-11-07 by aspirer

感觉不把flag立起来就一直不能静下心来动手写代码，先立起来，看看啥时候能搞定：

先写一个brpc的服务，学一学brpc怎么玩的，最简单的实现一个http服务（get、post）
再写一个braft应用，在多个节点上实现一个分布式的id查询和自增服务

2022-11-09

下载brpc代码库，v1.3版本分支，Ubuntu 22.04上完成编译，完成echo_c++ example代码编译和运行。下一步适当修改，改造成一个http的服务。

2022-11-11

简单改了下Echo示例代码，加了个rpc参数，表示消息长度，改成了http协议：

~/incubator-brpc/example/echo_c++$ git diff
diff --git a/example/echo_c++/client.cpp b/example/echo_c++/client.cpp
index 337aa6e9..0df24399 100644
--- a/example/echo_c++/client.cpp
+++ b/example/echo_c++/client.cpp
@@ -23,8 +23,7 @@
 #include <brpc/channel.h>
 #include "echo.pb.h"
 
-DEFINE_string(attachment, "", "Carry this along with requests");
-DEFINE_string(protocol, "baidu_std", "Protocol type. Defined in src/brpc/options.proto");
+DEFINE_string(protocol, "http", "Protocol type. Defined in src/brpc/options.proto");
 DEFINE_string(connection_type, "", "Connection type. Available values: single, pooled, short");
 DEFINE_string(server, "0.0.0.0:8000", "IP Address of server");
 DEFINE_string(load_balancer, "", "The algorithm for load balancing");
@@ -64,12 +63,10 @@ int main(int argc, char* argv[]) {
         example::EchoResponse response;
         brpc::Controller cntl;
 
-        request.set_message("hello world");
+        request.set_message("hello server123");
+        request.set_length(strlen("hello server123"));
 
         cntl.set_log_id(log_id ++);  // set by user
-        // Set attachment which is wired to network directly instead of 
-        // being serialized into protobuf messages.
-        cntl.request_attachment().append(FLAGS_attachment);
 
         // Because `done'(last parameter) is NULL, this function waits until
         // the response comes back or error occurs(including timedout).
@@ -77,8 +74,8 @@ int main(int argc, char* argv[]) {
         if (!cntl.Failed()) {
             LOG(INFO) << "Received response from " << cntl.remote_side()
                 << " to " << cntl.local_side()
-                << ": " << response.message() << " (attached="
-                << cntl.response_attachment() << ")"
+                << ": " << response.message() << " (length="
+                << response.length() << ")"
                 << " latency=" << cntl.latency_us() << "us";
         } else {
             LOG(WARNING) << cntl.ErrorText();
diff --git a/example/echo_c++/echo.proto b/example/echo_c++/echo.proto
index 2b39627f..8851b2e2 100644
--- a/example/echo_c++/echo.proto
+++ b/example/echo_c++/echo.proto
@@ -22,10 +22,12 @@ option cc_generic_services = true;
 
 message EchoRequest {
       required string message = 1;
+      required int32 length = 2;
 };
 
 message EchoResponse {
       required string message = 1;
+      required int32 length = 2;
 };
 
 service EchoService {
diff --git a/example/echo_c++/server.cpp b/example/echo_c++/server.cpp
index 41ffd0b1..549737f8 100644
--- a/example/echo_c++/server.cpp
+++ b/example/echo_c++/server.cpp
@@ -22,7 +22,6 @@
 #include <brpc/server.h>
 #include "echo.pb.h"
 
-DEFINE_bool(echo_attachment, true, "Echo attachment as well");
 DEFINE_int32(port, 8000, "TCP Port of this server");
 DEFINE_string(listen_addr, "", "Server listen address, may be IPV4/IPV6/UDS."
             " If this is set, the flag port will be ignored");
@@ -57,20 +56,11 @@ public:
                   << "] from " << cntl->remote_side() 
                   << " to " << cntl->local_side()
                   << ": " << request->message()
-                  << " (attached=" << cntl->request_attachment() << ")";
+                  << " (length=" << request->length() << ")";
 
         // Fill response.
-        response->set_message(request->message());
-
-        // You can compress the response by setting Controller, but be aware
-        // that compression may be costly, evaluate before turning on.
-        // cntl->set_response_compress_type(brpc::COMPRESS_TYPE_GZIP);
-
-        if (FLAGS_echo_attachment) {
-            // Set attachment which is wired to network directly instead of
-            // being serialized into protobuf messages.
-            cntl->response_attachment().append(cntl->request_attachment());
-        }
+        response->set_message("hello client");
+        response->set_length(strlen("hello client"));
     }
 };
 }  // namespace example

~/incubator-brpc/example/echo_c++$ git diff

diff --git a/example/echo_c++/client.cpp b/example/echo_c++/client.cpp

index 337aa6e9..0df24399 100644

--- a/example/echo_c++/client.cpp

+++ b/example/echo_c++/client.cpp

@@ -23,8 +23,7 @@

#include <brpc/channel.h>

#include "echo.pb.h"

-DEFINE_string(attachment, "", "Carry this along with requests");

-DEFINE_string(protocol, "baidu_std", "Protocol type. Defined in src/brpc/options.proto");

+DEFINE_string(protocol, "http", "Protocol type. Defined in src/brpc/options.proto");

DEFINE_string(connection_type, "", "Connection type. Available values: single, pooled, short");

DEFINE_string(server, "0.0.0.0:8000", "IP Address of server");

DEFINE_string(load_balancer, "", "The algorithm for load balancing");

@@ -64,12 +63,10 @@ int main(int argc, char* argv[]) {

example::EchoResponse response;

brpc::Controller cntl;

- request.set_message("hello world");

+ request.set_message("hello server123");

+ request.set_length(strlen("hello server123"));

cntl.set_log_id(log_id ++); // set by user

- // Set attachment which is wired to network directly instead of

- // being serialized into protobuf messages.

- cntl.request_attachment().append(FLAGS_attachment);

// Because `done'(last parameter) is NULL, this function waits until

// the response comes back or error occurs(including timedout).

@@ -77,8 +74,8 @@ int main(int argc, char* argv[]) {

if (!cntl.Failed()) {

LOG(INFO) << "Received response from " << cntl.remote_side()

<< " to " << cntl.local_side()

- << ": " << response.message() << " (attached="

- << cntl.response_attachment() << ")"

+ << ": " << response.message() << " (length="

+ << response.length() << ")"

<< " latency=" << cntl.latency_us() << "us";

} else {

LOG(WARNING) << cntl.ErrorText();

diff --git a/example/echo_c++/echo.proto b/example/echo_c++/echo.proto

index 2b39627f..8851b2e2 100644

--- a/example/echo_c++/echo.proto

+++ b/example/echo_c++/echo.proto

@@ -22,10 +22,12 @@ option cc_generic_services = true;

message EchoRequest {

required string message = 1;

+ required int32 length = 2;

};

message EchoResponse {

required string message = 1;

+ required int32 length = 2;

};

service EchoService {

diff --git a/example/echo_c++/server.cpp b/example/echo_c++/server.cpp

index 41ffd0b1..549737f8 100644

--- a/example/echo_c++/server.cpp

+++ b/example/echo_c++/server.cpp

@@ -22,7 +22,6 @@

#include <brpc/server.h>

#include "echo.pb.h"

-DEFINE_bool(echo_attachment, true, "Echo attachment as well");

DEFINE_int32(port, 8000, "TCP Port of this server");

DEFINE_string(listen_addr, "", "Server listen address, may be IPV4/IPV6/UDS."

" If this is set, the flag port will be ignored");

@@ -57,20 +56,11 @@ public:

<< "] from " << cntl->remote_side()

<< " to " << cntl->local_side()

<< ": " << request->message()

- << " (attached=" << cntl->request_attachment() << ")";

+ << " (length=" << request->length() << ")";

// Fill response.

- response->set_message(request->message());

- // You can compress the response by setting Controller, but be aware

- // that compression may be costly, evaluate before turning on.

- // cntl->set_response_compress_type(brpc::COMPRESS_TYPE_GZIP);

- if (FLAGS_echo_attachment) {

- // Set attachment which is wired to network directly instead of

- // being serialized into protobuf messages.

- cntl->response_attachment().append(cntl->request_attachment());

- }

+ response->set_message("hello client");

+ response->set_length(strlen("hello client"));

}

};

} // namespace example

运行结果：

~/incubator-brpc/example/echo_c++$ ./echo_client -server="127.0.0.1:8080"
I1111 09:37:14.304421 2015994 client.cpp:75] Received response from 127.0.0.1:8080 to 127.0.0.1:36476: hello client (length=12) latency=460us
I1111 09:37:15.305069 2015994 client.cpp:75] Received response from 127.0.0.1:8080 to 127.0.0.1:36476: hello client (length=12) latency=521us

~/incubator-brpc/example/echo_c++$ ./echo_server --port="8080"
I1111 09:37:56.076617 2016206 src/brpc/server.cpp:1070] Server[example::EchoServiceImpl] is serving on port=8080.
I1111 09:37:56.077233 2016206 src/brpc/server.cpp:1073] Check out http://hih-l-9493:8080 in web browser.
I1111 09:37:59.443775 2016217 server.cpp:55] Received request[log_id=7] from 127.0.0.1:60946 to 127.0.0.1:8080: hello server123 (length=15)
I1111 09:38:00.444778 2016216 server.cpp:55] Received request[log_id=8] from 127.0.0.1:60946 to 127.0.0.1:8080: hello server123 (length=15)

~/incubator-brpc/example/echo_c++$ ./echo_client -server="127.0.0.1:8080"

I1111 09:37:14.304421 2015994 client.cpp:75] Received response from 127.0.0.1:8080 to 127.0.0.1:36476: hello client (length=12) latency=460us

I1111 09:37:15.305069 2015994 client.cpp:75] Received response from 127.0.0.1:8080 to 127.0.0.1:36476: hello client (length=12) latency=521us

~/incubator-brpc/example/echo_c++$ ./echo_server --port="8080"

I1111 09:37:56.076617 2016206 src/brpc/server.cpp:1070] Server[example::EchoServiceImpl] is serving on port=8080.

I1111 09:37:56.077233 2016206 src/brpc/server.cpp:1073] Check out http://hih-l-9493:8080 in web browser.

I1111 09:37:59.443775 2016217 server.cpp:55] Received request[log_id=7] from 127.0.0.1:60946 to 127.0.0.1:8080: hello server123 (length=15)

I1111 09:38:00.444778 2016216 server.cpp:55] Received request[log_id=8] from 127.0.0.1:60946 to 127.0.0.1:8080: hello server123 (length=15)

curl请求：

/incubator-brpc/example/echo_c++$ curl -X GET -H 'Content-Type: application/json' -d '{"message":"yyy", "length": 3}'  localhost:8080/EchoService/Echo
{"message":"hello client","length":12}

# 或者POST请求也可以
~/incubator-brpc/example/echo_c++$ curl -X POST -H 'Content-Type: application/json' -d '{"message":"yyy", "length": 31}'  localhost:8080/EchoService/Echo
{"message":"hello client","length":12}

~/incubator-brpc/example/echo_c++$ ./echo_server --port="8080"
I1111 09:38:30.836687 2019460 src/brpc/server.cpp:1070] Server[example::EchoServiceImpl] is serving on port=8080.
I1111 09:38:30.837011 2019460 src/brpc/server.cpp:1073] Check out http://hih-l-9493:8080 in web browser.
I1111 09:38:52.031097 2019465 server.cpp:55] Received request[log_id=0] from 127.0.0.1:41962 to 127.0.0.1:8080: yyy (length=3)

/incubator-brpc/example/echo_c++$ curl -X GET -H 'Content-Type: application/json' -d '{"message":"yyy", "length": 3}' localhost:8080/EchoService/Echo

{"message":"hello client","length":12}

# 或者POST请求也可以

~/incubator-brpc/example/echo_c++$ curl -X POST -H 'Content-Type: application/json' -d '{"message":"yyy", "length": 31}' localhost:8080/EchoService/Echo

{"message":"hello client","length":12}

~/incubator-brpc/example/echo_c++$ ./echo_server --port="8080"

I1111 09:38:30.836687 2019460 src/brpc/server.cpp:1070] Server[example::EchoServiceImpl] is serving on port=8080.

I1111 09:38:30.837011 2019460 src/brpc/server.cpp:1073] Check out http://hih-l-9493:8080 in web browser.

I1111 09:38:52.031097 2019465 server.cpp:55] Received request[log_id=0] from 127.0.0.1:41962 to 127.0.0.1:8080: yyy (length=3)

HTTP service，读文件内容：

~/incubator-brpc/example/http_c++$ git diff http_server.cpp
diff --git a/example/http_c++/http_server.cpp b/example/http_c++/http_server.cpp
index d20ee71a..560496e8 100644
--- a/example/http_c++/http_server.cpp
+++ b/example/http_c++/http_server.cpp
@@ -22,6 +22,8 @@
 #include <brpc/server.h>
 #include <brpc/restful.h>
 #include "http.pb.h"
+#include <fstream>
+#include <string>
 
 DEFINE_int32(port, 8010, "TCP Port of this server");
 DEFINE_int32(idle_timeout_s, -1, "Connection will be closed if there is no "
@@ -105,8 +107,17 @@ public:
             bthread_t th;
             bthread_start_background(&th, NULL, SendLargeFile, args.release());
         } else {
-            cntl->response_attachment().append("Getting file: ");
-            cntl->response_attachment().append(filename);
+            std::string line;
+            std::ifstream myfile(filename);
+            if (myfile.is_open()) {
+                cntl->response_attachment().append("Getting file: " + filename + "\n");
+                while (getline(myfile, line)) {
+                    cntl->response_attachment().append(line + "\n");
+                }
+                myfile.close();
+            } else {
+                cntl->response_attachment().append("No such file");
+            }
         }
     }
 };
@@ -175,7 +186,8 @@ int main(int argc, char* argv[]) {
         return -1;
     }
     if (server.AddService(&file_svc,
-                          brpc::SERVER_DOESNT_OWN_SERVICE) != 0) {
+                          brpc::SERVER_DOESNT_OWN_SERVICE,
+                          "/v1/getfile/* => default_method") != 0) {
         LOG(ERROR) << "Fail to add file_svc";
         return -1;
     }

~/incubator-brpc/example/http_c++$ git diff http_server.cpp

diff --git a/example/http_c++/http_server.cpp b/example/http_c++/http_server.cpp

index d20ee71a..560496e8 100644

--- a/example/http_c++/http_server.cpp

+++ b/example/http_c++/http_server.cpp

@@ -22,6 +22,8 @@

#include <brpc/server.h>

#include <brpc/restful.h>

#include "http.pb.h"

+#include <fstream>

+#include <string>

DEFINE_int32(port, 8010, "TCP Port of this server");

DEFINE_int32(idle_timeout_s, -1, "Connection will be closed if there is no "

@@ -105,8 +107,17 @@ public:

bthread_t th;

bthread_start_background(&th, NULL, SendLargeFile, args.release());

} else {

- cntl->response_attachment().append("Getting file: ");

- cntl->response_attachment().append(filename);

+ std::string line;

+ std::ifstream myfile(filename);

+ if (myfile.is_open()) {

+ cntl->response_attachment().append("Getting file: " + filename + "\n");

+ while (getline(myfile, line)) {

+ cntl->response_attachment().append(line + "\n");

+ }

+ myfile.close();

+ } else {

+ cntl->response_attachment().append("No such file");

+ }

}

};

@@ -175,7 +186,8 @@ int main(int argc, char* argv[]) {

return -1;

}

if (server.AddService(&file_svc,

- brpc::SERVER_DOESNT_OWN_SERVICE) != 0) {

+ brpc::SERVER_DOESNT_OWN_SERVICE,

+ "/v1/getfile/* => default_method") != 0) {

LOG(ERROR) << "Fail to add file_svc";

return -1;

}

运行结果：

~/incubator-brpc/example/http_c++$ ./http_client "localhost:8010/v1/getfile/http.proto"
Getting file: http.proto
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements.  See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership.  The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License.  You may obtain a copy of the License at
//
......


~/incubator-brpc/example/http_c++$ curl "localhost:8010/v1/getfile/http.proto"
Getting file: http.proto
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements.  See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership.  The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License.  You may obtain a copy of the License at
//
......

~/incubator-brpc/example/http_c++$ ./http_client "localhost:8010/v1/getfile/http.proto"

Getting file: http.proto

// Licensed to the Apache Software Foundation (ASF) under one

// or more contributor license agreements. See the NOTICE file

// distributed with this work for additional information

// regarding copyright ownership. The ASF licenses this file

// to you under the Apache License, Version 2.0 (the

// "License"); you may not use this file except in compliance

// with the License. You may obtain a copy of the License at

......

~/incubator-brpc/example/http_c++$ curl "localhost:8010/v1/getfile/http.proto"

Getting file: http.proto

// Licensed to the Apache Software Foundation (ASF) under one

// or more contributor license agreements. See the NOTICE file

// distributed with this work for additional information

// regarding copyright ownership. The ASF licenses this file

// to you under the Apache License, Version 2.0 (the

// "License"); you may not use this file except in compliance

// with the License. You may obtain a copy of the License at

......

技术

236. 二叉树的最近公共祖先

Posted on 2022-11-07 by aspirer

题目链接：https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/

不会做，看的答案。

原理是先遍历二叉树，用hash map记录所有节点的父节点，然后分别遍历p、q节点的父节点并染色（用hash map记录节点是否染色过），遇到重复染色的节点即为二者的共同祖先节点。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    unordered_map<int, TreeNode*> father;
    unordered_map<int, bool> colored;

    void dfs(TreeNode* root) {
        if (!root) {
            return;
        }
        if (root->left) {
            father[root->left->val] = root;
            dfs(root->left);
        }
        if (root->right) {
            father[root->right->val] = root;
            dfs(root->right);
        }
    }

    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        father[root->val] = NULL;
        dfs(root);
        while (p) {
            colored[p->val] = true;
            p = father[p->val];
        }
        while (q) {
            if (colored[q->val]) {
                return q;
            }
            q = father[q->val];
        }
        return NULL;
    }
};

/**

* Definition for a binary tree node.

* struct TreeNode {

* int val;

* TreeNode *left;

* TreeNode *right;

* TreeNode(int x) : val(x), left(NULL), right(NULL) {}

* };

class Solution {

public:

unordered_map<int, TreeNode*> father;

unordered_map<int, bool> colored;

void dfs(TreeNode* root) {

if (!root) {

return;

}

if (root->left) {

father[root->left->val] = root;

dfs(root->left);

}

if (root->right) {

father[root->right->val] = root;

dfs(root->right);

}

TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {

father[root->val] = NULL;

dfs(root);

while (p) {

colored[p->val] = true;

p = father[p->val];

}

while (q) {

if (colored[q->val]) {

return q;

}

q = father[q->val];

}

return NULL;

}

};