克拉拉123
码龄7年
关注
提问 私信
  • 博客:22,942
    22,942
    总访问量
  • 103
    原创
  • 839,935
    排名
  • 1
    粉丝
  • 0
    铁粉
IP属地以运营商信息为准,境内显示到省(区、市),境外显示到国家(地区)
IP 属地:浙江省
  • 加入CSDN时间: 2018-03-03
博客简介:

克拉拉的博客

博客描述:
个人LEETCODE\PAT\OJ算法题解,知识见解
查看详细资料
个人成就
  • 获得5次点赞
  • 内容获得1次评论
  • 获得10次收藏
  • 博客总排名839,935名
创作历程
  • 1篇
    2019年
  • 103篇
    2018年
成就勋章
创作活动更多

王者杯·14天创作挑战营·第2期

这是一个以写作博客为目的的创作活动,旨在鼓励码龄大于4年的博主们挖掘自己的创作潜能,展现自己的写作才华。如果你是一位热爱写作的、想要展现自己创作才华的小伙伴,那么,快来参加吧!我们一起发掘写作的魅力,书写出属于我们的故事。 注: 1、参赛者可以进入活动群进行交流、分享创作心得,互相鼓励与支持(开卷),答疑及活动群请见https://bbs.csdn.net/topics/619735097 2、文章质量分查询:https://www.csdn.net/qc 我们诚挚邀请你们参加为期14天的创作挑战赛!

56人参与 去参加
  • 最近
  • 文章
  • 代码仓
  • 资源
  • 问答
  • 帖子
  • 视频
  • 课程
  • 关注/订阅/互动
  • 收藏
搜TA的内容
搜索 取消

不成型贪吃蛇

瞎写的试手,日后改进。#include<iostream>#include<queue>#include<map>#include<string>#include<cstring>#include<cstdio>#include<vector>#include<conio.h&am
原创
发布博客 2019.03.12 ·
189 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1018 Public Bike Management

There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to any other stations in the ...
原创
发布博客 2018.11.15 ·
277 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1072 Gas Station

A gas station has to be built at such a location that the minimum distance between the station and any of the residential housing is as far away as possible. However it must guarantee that all the hou...
原创
发布博客 2018.11.15 ·
247 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1087 All Roads Lead to Rome

Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness.Input Specification:Each ...
原创
发布博客 2018.11.14 ·
193 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1030 Travel Plan

A traveler's map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to decide the shortest path b...
原创
发布博客 2018.11.13 ·
153 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1003 Emergency

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the l...
原创
发布博客 2018.11.13 ·
110 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1013 Battle Over Cities

It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we nee...
原创
发布博客 2018.11.11 ·
121 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1013 Battle Over Cities

It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we nee...
原创
发布博客 2018.11.11 ·
121 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1076 Forwards on Weibo

Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a ...
原创
发布博客 2018.11.10 ·
138 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1034 Head of a Gang

One way that the police finds the head of a gang is to check people's phone calls. If there is a phone call between A and B, we say that A and B is related. The weight of a relation is defined to be t...
原创
发布博客 2018.11.07 ·
140 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1098 Insertion or Heap Sort

According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data,...
原创
发布博客 2018.11.01 ·
113 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

一道考研题

第58题。数据输入换成数字,方便点,先建立二叉树再输出。 #include<iostream>#include<queue>using namespace std;struct node { int data; node* lchild; node* rchild;};const int maxn = 35;int pos[maxn];int ...
原创
发布博客 2018.10.31 ·
185 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1107 Social Clusters

When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A social cluster is a set of people who have some of thei...
原创
发布博客 2018.10.28 ·
106 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1066 Root of AVL Tree

An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is...
原创
发布博客 2018.10.26 ·
109 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1099 Build A Binary Search Tree

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node's key. The right su...
原创
发布博客 2018.10.19 ·
331 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1064 Complete Binary Search Tree

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node's key. The right su...
原创
发布博客 2018.10.19 ·
149 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1043 Is It a Binary Search Tree

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node's key. The right su...
原创
发布博客 2018.10.18 ·
91 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1004 Counting Leaves

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contains one test case. Each case starts...
原创
发布博客 2018.10.12 ·
120 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1106 Lowest Price in Supply Chain

A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer.Starting from one root supplier, everyone on th...
原创
发布博客 2018.10.10 ·
109 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

PAT.A1094 The Largest Generation

 void bfs() { int level = 2, last = 1, first = 0, rear = 0, num = 0; queue<int> q; q.push(1); //l[1] = 1; rear++; lnum[1] = 1; while (!q.empty()) { int f = q.front(); q.pop(); fi...
原创
发布博客 2018.10.08 ·
108 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏
加载更多