• 博客园logo
  • 会员
  • 众包
  • 新闻
  • 博问
  • 闪存
  • 赞助商
  • HarmonyOS
  • Chat2DB
    • 搜索
      所有博客
    • 搜索
      当前博客
  • 写随笔 我的博客 短消息 简洁模式
    用户头像
    我的博客 我的园子 账号设置 会员中心 简洁模式 ... 退出登录
    注册 登录
 






tccbj

 
 

Powered by 博客园
博客园 | 首页 | 新随笔 | 联系 | 订阅 订阅 | 管理

2019年2月22日

PAT A1142 Maximal Clique (25 分)——图
摘要: A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. A maximal clique is a clique 阅读全文
posted @ 2019-02-22 19:19 tccbj 阅读(129) 评论(0) 推荐(0)
 
PAT A1141 PAT Ranking of Institutions (25 分)——排序,结构体初始化
摘要: After each PAT, the PAT Center will announce the ranking of institutions based on their students' performances. Now you are asked to generate the rank 阅读全文
posted @ 2019-02-22 16:44 tccbj 阅读(196) 评论(0) 推荐(0)
 
PAT A1140 Look-and-say Sequence (20 分)——数学题
摘要: Look-and-say sequence is a sequence of integers as the following: D, D1, D111, D113, D11231, D112213111, ... where D is in [0, 9] except 1. The (n+1)s 阅读全文
posted @ 2019-02-22 14:22 tccbj 阅读(142) 评论(0) 推荐(0)
 
PAT A1143 Lowest Common Ancestor (30 分)——二叉搜索树,lca
摘要: The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants. A binary search tree (BST) i 阅读全文
posted @ 2019-02-22 10:54 tccbj 阅读(273) 评论(0) 推荐(0)
 
PAT A1151 LCA in a Binary Tree (30 分)——二叉树,最小公共祖先(lca)
摘要: The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants. Given any two nodes in a bin 阅读全文
posted @ 2019-02-22 10:36 tccbj 阅读(208) 评论(0) 推荐(0)