_Zlrrr - 博客园

2018年12月13日

摘要： https://leetcode.com/problems/sum-of-left-leaves/ Find the sum of all left leaves in a given binary tree. Example: 代码：阅读全文

posted @ 2018-12-13 19:45 _Zlrrr 阅读(120) 评论(0) 推荐(0)

PAT 甲级 1012 The Best Rank

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805502658068480 To evaluate the performance of our first year CS majored students, we co 阅读全文

posted @ 2018-12-13 16:07 _Zlrrr 阅读(330) 评论(0) 推荐(0)

ZOJ 1909 I-Square

摘要： https://vjudge.net/contest/67836#problem/I Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square? Input Th 阅读全文

posted @ 2018-12-13 13:41 _Zlrrr 阅读(221) 评论(0) 推荐(0)

2018年12月12日

蓝桥杯入门训练

摘要： http://lx.lanqiao.cn/problemset.page?code=BEGIN-&userid=246004 BEGIN-1 A+B问题代码： #include <bits/stdc++.h> using namespace std; int A, B; int main() { 阅读全文

posted @ 2018-12-12 20:31 _Zlrrr 阅读(237) 评论(0) 推荐(0)

#Leetcode# 108. Convert Sorted Array to Binary Search Tree

摘要： https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ Given an array where elements are sorted in ascending order, convert it to a 阅读全文

posted @ 2018-12-12 20:04 _Zlrrr 阅读(148) 评论(0) 推荐(0)

2018年12月10日

#Leetcode# 897. Increasing Order Search Tree

摘要： https://leetcode.com/problems/increasing-order-search-tree/ Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now 阅读全文

posted @ 2018-12-10 22:50 _Zlrrr 阅读(223) 评论(0) 推荐(0)

#Leetcode# 326. Power of Three

摘要： https://leetcode.com/problems/power-of-three/ Given an integer, write a function to determine if it is a power of three. Example 1: Example 2: Example 阅读全文

posted @ 2018-12-10 22:30 _Zlrrr 阅读(109) 评论(0) 推荐(0)

#Leetcode# 319. Bulb Switcher

摘要： https://leetcode.com/problems/bulb-switcher/ There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every secon 阅读全文

posted @ 2018-12-10 20:21 _Zlrrr 阅读(135) 评论(0) 推荐(0)

#Leetcode# 94. Binary Tree Inorder Traversal

摘要： https://leetcode.com/problems/binary-tree-inorder-traversal/ Given a binary tree, return the inorder traversal of its nodes' values. Example: 代码：二叉树阅读全文

posted @ 2018-12-10 19:51 _Zlrrr 阅读(122) 评论(0) 推荐(0)

#LeetCode# 101. Symmetric Tree

摘要： https://leetcode.com/problems/symmetric-tree/ Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For examp 阅读全文

posted @ 2018-12-10 16:13 _Zlrrr 阅读(127) 评论(0) 推荐(0)

丧心病狂工科女

公告