Java
V2beach
加油
展开
-
LeetCode-002两数相加(Add Two Numbers)
LeetCode-002 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two number...原创 2019-06-20 23:32:04 · 153 阅读 · 0 评论 -
Java was started but returned exit code=1?
如果你也像我一样在「运行时」遇到了下图这样的问题。 运行时Eclipse闪退,如果你也试遍了网上诸如修改Eclipse.ini,改变设置防止内存溢出等方法,还无效, 不要急着重装Eclipse或者重新配置Jdk抑或检查Jvm,好好找一下是不是代码自身的问题!我修改了大量设置和配置文件之后才回头考虑,想起来程序的空指针异常,修改之后正常运行,教训惨痛,引以为戒。 ...原创 2019-06-20 20:57:25 · 348 阅读 · 0 评论 -
LeetCode-003无重复字符的最长子串(Longest Substring Without Repeating Characters)
LeetCode-003 Given a string, find the length of the longest substring without repeating characters. Example Example 1: Input: “abcabcbb” Output: 3 Explanation: The answer is “abc”, with the lengt...原创 2019-06-21 11:24:12 · 164 阅读 · 0 评论 -
LeetCode-021合并两个有序链表(Merge Two Sorted Lists)
LeetCode-021 Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Example Input: 1->2->4, 1->3-&g...原创 2019-06-23 12:54:10 · 152 阅读 · 0 评论 -
LeetCode-105从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal)
LeetCode-105 Given preorder and inorder traversal of a tree, construct the binary tree. Example input: preorder = [3,9,20,15,7] inorder = [9,3,15,20,7] return: [3,9,20,null,null,15,7]  ...原创 2019-06-24 11:22:16 · 212 阅读 · 0 评论 -
LeetCode-144二叉树的前序遍历(Binary Tree Preorder Traversal)
LeetCode-144 Given a binary tree, return the preorder traversal of its nodes’ values. Example Input: [1,null,2,3] 1 \ 2 &nb...原创 2019-06-24 11:55:59 · 130 阅读 · 0 评论 -
LeetCode-145二叉树的后序遍历(Binary Tree Postorder Traversal)
LeetCode-145 Given a binary tree, return the postorder traversal of its nodes’ values. Example Input: [1,null,2,3] 1 \ 2 &n...原创 2019-06-24 19:08:57 · 128 阅读 · 0 评论 -
LeetCode-94二叉树的中序遍历(Binary Tree Inorder Traversal)
LeetCode-145 Given a binary tree, return the inorder traversal of its nodes’ values. Example Input: [1,null,2,3] 1 \ 2 &nbs...原创 2019-06-24 19:14:14 · 156 阅读 · 0 评论 -
LeetCode-104二叉树的最大深度(Maximum Depth of Binary Tree)
LeetCode-104 Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Example Input: Given b...原创 2019-06-24 20:13:27 · 150 阅读 · 0 评论