whl_program的博客

原题链接：https://leetcode-cn.com/problems/sum-of-left-leaves/思路：递归，dfs左叶子节点：是父亲节点的左孩子，左节点和右节点都是null代码/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} *

原题链接https://leetcode-cn.com/problems/letter-case-permutation/submissions/思路：类似于字符串全排列，只是不需要变换位置，改成了转换大小写代码class Solution { public List<String> letterCasePermutation(String s) { List<String> result = new ArrayList<>();

202. Happy Number原题链接 Write an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the

12. Integer to Roman点击查看相关题 罗马数字转化为整数 Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.题目大意： 给定一个整数，将其转换为罗马数字。 输入保证在1到3999之间。首先明确组合规则： (1)

217. Contains DuplicateGiven 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 fal

447. Number of Boomerangs原题链接 Given n points in the plane that are all pairwise distinct, a “boomerang” is a tuple of points (i, j, k) such that the distance between i and j equals the distance betwee

563. Binary Tree TiltGiven a binary tree, return the tilt of the whole tree.The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of

575. Distribute Candies原题链接 Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind.

344. Reverse StringWrite a function that takes a string as input and returns the string reversed. 题目大意：反向输出字符串Example:Given s = "hello", return "olleh".代码如下C++class Solution {public: string reve

LeetCode 461. Hamming Distance题目描述：The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two integers x and y, calculate the Hamm...

476. Number Complement题目描述：Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation. 给定一个正整数，输出其补数。 补码策略是翻转其二进制表示的位。Note:（数据范围）

500. Keyboard RowGiven a List of words, return the words that can be typed using letters of alphabet on only one row’s of American keyboard like the image below. 给定一个单词列表，返回可以只在美国键盘的一行上输入的单词（使用字母表中的字母

496. Next Greater Element IYou are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1’s elements in the corres

463. Island PerimeterYou are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The

485. Max Consecutive OnesGiven a binary array, find the maximum number of consecutive 1s in this array. 题目大意：给一个二进制数组，找到连续为1的最大数量Example 1:Input: [1,1,0,1,1,1]Output: 3Explanation: The first two di

292. Nim GameYou are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone

520. Detect CapitalGiven a word, you need to judge whether the usage of capitals in it is right or not. We define the usage of capitals in a word to be right when one of the following cases holds: -

13. Roman to Integer点击查看相关题 整数转化为罗马数字 Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.题目大意： 给定一个罗马数字，将其转换为整数。 输入保证在1到3999之间。罗马数字定义：罗马数字共有

268. Missing Number原题链接 Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array. 给定一个包含从0，1，2，…，n中取出的n个不同数字的数组，找到数组中缺少的元素。 For exampleGiven

437. Path Sum III原题链接 相似题目题解：112. Path Sum && 113. Path Sum IIYou are given a binary tree in which each node contains an integer value.Find the number of paths that sum to a given value.The path does

113. Path Sum II原题链接 相似题目题解：112. Path Sum && 437. Path Sum III Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.For example: Given the below binar

112. Path Sum原题链接 相似题目题解：113. Path Sum II && 437. Path Sum III Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equa

70. Climbing Stairs原题链接 You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?原题大意：给一个台阶数

83. Remove Duplicates from Sorted List原题链接 Given a sorted linked list, delete all duplicates such that each element appear only once. 给一个链表，删除重复元素 For example,Given 1->1->2, return 1->2.Given 1->1-

231. Power of Two原题链接参考相似题326. Power of ThreeGiven an integer, write a function to determine if it is a power of two.给一个整数，写一个函数判断是否是2的幂。思路：判断是否<=0 或者>2147483647，是的话返回false判断n%2 == 0，是的话n /= 2，循环进行，一

326. Power of Three原题链接参考相似题 [LeetCode] 231. Power of TwoGiven an integer, write a function to determine if it is a power of three. 给一个整数，写一个函数判断其是否是3的幂Follow up:Could you do it without using any loop

121. Best Time to Buy and Sell Stock原题链接 Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, bu

405. Convert a Number to Hexadecimal原题链接 Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used. 题目大意： 给一个整数，写出它的十六进制，对于负整数，可以用二进制补码

415. Add Strings原题链接 Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2. 给定两个用字符串表示的非负整数num1和num2，返回用字符串表示的num1和num2的和。Note:The length of both num1

108. Convert Sorted Array to Binary Search Tree原题链接 Given an array where elements are sorted in ascending order, convert it to a height balanced BST.题目大意： 给定一个升序数组，转化为一个平衡二叉树思路：首先要了解二叉排序树BST的定义。给定一个

572. Subtree of Another Tree原题链接 Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of

543. Diameter of Binary Tree原题链接 Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes

541. Reverse String II原题链接 Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k character

136. Single NumberGiven an array of integers, every element appears twice except for one. Find that single one. 题目大意:给定一个整数数组，每个元素出现两次，只要一个元素出现一次。 找到这个元素。 Note: Your algorithm should have a linear r

448. Find All Numbers Disappeared in an ArrayGiven 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] inclu

104. Maximum Depth of Binary TreeGiven 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. 题目大意： 给

168. Excel Sheet Column Title和171题是一个类型的，参考[LeetCode]171. Excel Sheet Column NumberGiven a positive integer, return its corresponding column title as appear in an Excel sheet. 给定一个正整数，返回相应的列标题，如Excel表

171. Excel Sheet Column Number和168题是一个类型的，参考[LeetCode]168. Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number. 给出Excel表格中显示的列标题，返回其对应的列号。F

237. Delete Node in a Linked ListWrite a function to delete a node (except the tail) in a singly linked list, given only access to that node. 编写一个函数来删除单链表中的节点（尾部除外），只允许访问该节点。Supposed the linked list i

100. Same TreeGiven two binary trees, write a function to check if they are equal or not. 给定两个二叉树，写一个函数来检查它们是否相等。Two binary trees are considered equal if they are structurally identical and the nodes