leetcode OJ
文章平均质量分 55
HWHuangeian
每天学习一点点,每天进步一点点
展开
-
235.Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined betw原创 2015-10-08 18:59:38 · 370 阅读 · 0 评论 -
102.Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20原创 2015-10-11 16:59:50 · 295 阅读 · 0 评论 -
144.Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive soluti原创 2015-10-08 19:06:10 · 321 阅读 · 0 评论 -
94.Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solutio原创 2015-10-08 19:07:50 · 287 阅读 · 0 评论 -
226.Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1/** * Definition for a binary tree node. * public class TreeNode原创 2015-10-08 18:57:15 · 323 阅读 · 0 评论 -
283.Move Zeroes
public class Solution { /* * 设置一个标志位i,遍历数组每个值 * 如果值为0,标志位i加一;否则加入自定义数组中 * 遍历结束后将个数为i的0追加到自定义数组尾部 */ public void moveZeroes(int[] nums) { int[] arrayNums = new int[n原创 2015-10-08 18:54:44 · 330 阅读 · 0 评论 -
260.Single Number III
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example:Given原创 2015-10-08 19:02:40 · 361 阅读 · 0 评论 -
100.Same Tree
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution {原创 2015-10-08 18:53:31 · 357 阅读 · 0 评论 -
237.Delete Node in a Linked List
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class Solution { /* * A->B->C原创 2015-10-08 18:52:32 · 311 阅读 · 0 评论 -
104.Maximum Depth of Binary Tree
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution {原创 2015-10-08 18:51:11 · 352 阅读 · 0 评论 -
136.Single Number
public class Solution { /* * 将数组里的值逐个进行异或运算 * 最终类似有0000 ^ 1010 = 1010 * 1010即那个唯一的数 */ public int singleNumber(int[] nums) { if(nums == null || nums.length == 0){原创 2015-10-08 18:48:57 · 288 阅读 · 0 评论 -
258.Add Digits
public class Solution { /* * 通过while循环,每循环一次得到一个位并存入数组 * 循环结束后,把数组里的值加起来得到一个数 * 若这个数为个位,返回这个数 * 若这个数不为个位,再进行递归 */ public int addDigits(int num) { in原创 2015-10-08 18:41:01 · 312 阅读 · 0 评论 -
217.Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element原创 2015-10-08 19:04:45 · 350 阅读 · 0 评论 -
191.Number of 1 Bits
Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11' has binary representation 000000原创 2015-10-08 19:01:20 · 376 阅读 · 0 评论 -
145.Binary Tree Postorder Traversal
Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1]./** * Definition for a原创 2015-10-11 17:04:43 · 322 阅读 · 0 评论