{ ZhongZhehua }

About Me

感谢各位光临我的小破站！我是钟哲华，来自浙江杭州，目前就读于杭州电子科技大学，硕士三年级。我的研究方向为nlp领域的AI安全问题。在算法方面，我擅长深度学习、博弈论和凸优化；我常用的开发语言有Python和C++。我的个人亮点有曾获中国研究生数学建模竞赛国家级三等奖、本科期间获得过浙江省政府奖学金，以及有多项公开发明专利。此外，我硕士期间的研究成果已投至人工智能领域的顶级会议（IJCAI），目前仍在审稿中。

请随意浏览，记得常来。网站还在持续建设中！

Thank you for visiting my little shitty website! I am Zhehua Zhong, from Hangzhou, Zhejiang province, currently studying in Hangzhou Dianzi University, third year of master. My research interests are AI security problems in nlp. In terms of algorithms, I am good at deep learning, game theory and convex optimization; my common development languages are Python and C++. My personal highlights include winning the third prize at the national level in the China Graduate Mathematical Modeling Competition, winning the Zhejiang Provincial Government Scholarship during my undergraduate years, and having several public invention patents. In addition, my research results during my master’s degree have been submitted to the top conference in artificial intelligence (IJCAI) and are currently under review.

Please feel free to browse and remember to come back frequently. The site is still under continuous construction!

Latest Blog Post

算法简介回溯算法实际上一个类似枚举的搜索尝试过程，主要是在搜索尝试过程中寻找问题的解，当发现已不满足求解条件时，就“回溯”返回，尝试别的路径。算法模板 def Solution(): res = [] # 可行结果集 def backtracking(v=[]): if (required): # 满足条件 res.append(v) return if (beyond): # 超过边界 return for k in feasible_set: # 遍历可行集合 backtracking(v + [k]) # 尝试k，进行下一步求解 backtracking() return res

def Solution(): res = [] # 可行结果集 def backtracking(v=[]): if (required): # 满足条件 res.append(v[:]) return if (beyond): # 超过边界 return for k in feasible_set: # 遍历可行集合 v.append(k) backtracking(v) # 尝试k，进行下一步求解 v.pop() backtracking() return res

例1：力扣46. 全排列给定一个不含重复数字的数组 nums ，返回其所有可能的全排列。你可以按任意顺序返回答案。示例 1：输入：nums = [1,2,3] 输出：[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]

示例 2：输入：nums = [0,1] 输出：[[0,1],[1,0]]

示例 3：输入：nums =...

Timeline