绿叶萌飞

分类

Android(41) Android Studio(13) eclipse(1) javascript(1) java基础(19) java并发编程(1) JVM(2) leetcode(11) linux命令行（译文）(38) MySQL(1) PTA(8) 个人js代码笔记——不详细解释(10) 其他(1) 周记随笔(7) 多线程(2) 我的android学习笔记(22) 数据结构与算法(85) 编程时光(5) 编程语言(20) 蓝桥杯(5) 计算机常用基础(1) 计算机网络(9) 迁移牛客网说明(1)

/ 注册

全部文章（共9篇）

724. Find Pivot Index(寻找数组的中心索引)

题目地址：https://leetcode.com/problems/find-pivot-index/description/ Given an array of integers nums, write a method that returns the "pivot" i...

leetcode

2018-05-05

0 495

67. Add Binary(二进制求和)

题目地址：https://leetcode.com/problems/add-binary/description/ Given two binary strings, return their sum (also a binary string). The input strings are ...

leetcode

2018-05-05

0 420

572. Subtree of Another Tree(另一个树的子树)

题目地址:https://leetcode.com/problems/subtree-of-another-tree/description/ Given two non-empty binary trees s and t, check whether tree t has exactly th...

leetcode

2018-05-07

0 391

268. Missing Number(缺失数字)

题目地址：https://leetcode.com/problems/missing-number/description/ Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one ...

leetcode

2018-05-22

0 476

144. Binary Tree Preorder Traversal(二叉树的前序遍历)

题目地址：https://leetcode.com/problems/binary-tree-preorder-traversal/description/ Given a binary tree, return the preorder traversal of its nodes' value...

leetcode

2018-05-24

0 418

448. Find All Numbers Disappeared in an Array(找到所有数组中消失的数字)

Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n]...

leetcode

2018-09-13

0 340

3. Longest Substring Without Repeating Characters(无重复字符的最长子串)

Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanatio...

leetcode

2018-09-13

0 358

9. Palindrome Number(回文数)

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Input: 121 Output: ...

leetcode

2018-10-01

0 357

11. Container With Most Wate(盛最多水的容器)

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endp...

leetcode

2018-10-08

0 442