丧心病狂工科女

2018年12月5日

摘要： https://leetcode.com/problems/invert-binary-tree/ Invert a binary tree. Example: Input: Output: Trivia:This problem was inspired by this original twee 阅读全文

posted @ 2018-12-05 23:29 丧心病狂工科女阅读(100) 评论(0) 推荐(0) 编辑

zufe 蓝桥选拔

摘要： https://zufeoj.com/contest.php?cid=1483 问题 A: A 代码： #include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int n; int num[maxn]; map 阅读全文

posted @ 2018-12-05 22:53 丧心病狂工科女阅读(222) 评论(0) 推荐(0) 编辑

#Leetcode# 100. Same Tree

摘要： https://leetcode.com/problems/same-tree/ Given two binary trees, write a function to check if they are the same or not. Two binary trees are considere 阅读全文

posted @ 2018-12-05 19:51 丧心病狂工科女阅读(129) 评论(0) 推荐(0) 编辑

#Leetcode# 6. ZigZag Conversion

摘要： https://leetcode.com/problems/zigzag-conversion/ The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you 阅读全文

posted @ 2018-12-05 13:58 丧心病狂工科女阅读(139) 评论(0) 推荐(0) 编辑

2018年12月4日

PAT 1084 外观数列

摘要： https://pintia.cn/problem-sets/994805260223102976/problems/994805260583813120 外观数列是指具有以下特点的整数序列：它从不等于 1 的数字 d 开始，序列的第 n+1 项是对第 n 项的描述。比如第 2 项表示第 1 项有阅读全文

posted @ 2018-12-04 22:34 丧心病狂工科女阅读(265) 评论(0) 推荐(0) 编辑

#Leetcode# 38. Count and Say

摘要： https://leetcode.com/problems/count-and-say/ The count-and-say sequence is the sequence of integers with the first five terms as following: 1 is read 阅读全文

posted @ 2018-12-04 22:32 丧心病狂工科女阅读(239) 评论(0) 推荐(0) 编辑

#Leetcode# 22. Generate Parentheses

摘要： https://leetcode.com/problems/generate-parentheses/ Given n pairs of parentheses, write a function to generate all combinations of well-formed parenth 阅读全文

posted @ 2018-12-04 22:26 丧心病狂工科女阅读(102) 评论(0) 推荐(0) 编辑

#Leetcode# 41. First Missing Positive

摘要： https://leetcode.com/problems/first-missing-positive/ Given an unsorted integer array, find the smallest missing positive integer. Example 1: Example 阅读全文

posted @ 2018-12-04 22:05 丧心病狂工科女阅读(136) 评论(0) 推荐(0) 编辑

#Leetcode# 40. Combination Sum II

摘要： https://leetcode.com/problems/combination-sum-ii/ Given a collection of candidate numbers (candidates) and a target number (target), find all unique c 阅读全文

posted @ 2018-12-04 21:52 丧心病狂工科女阅读(115) 评论(0) 推荐(0) 编辑

PAT 1055 集体照

摘要： https://pintia.cn/problem-sets/994805260223102976/problems/994805272021680128 拍集体照时队形很重要，这里对给定的 N 个人 K 排的队形设计排队规则如下：每排人数为 N/K（向下取整），多出来的人全部站在最后一排；后排阅读全文

posted @ 2018-12-04 10:21 丧心病狂工科女阅读(255) 评论(0) 推荐(0) 编辑

丧心病狂工科女

公告