198. 打家劫舍 - 你是一个专业的小偷,计划偷窃沿街的房屋。每间房内都藏有一定的现金,影响你偷窃的唯一制约因素就是相邻的房屋装有相互连通的防盗系统,如果两间相邻的房屋在同一晚上被小偷闯入,系统会自动报警。 给定一个代表每个房屋存放金额的非负整数数组,计算你
package y2019.Algorithm.dynamicprogramming.easy; /** * @ProjectName: cutter-point * @Package: y2019.Algorithm.dynamicprogramming.easy * @ClassName: Ro
今天的字符类还比较简单 package y2019.Algorithm.str.easy; import java.util.HashMap; import java.util.Map; import java.util.Stack; /** * @ClassName IsValid * @Description 20. Valid Parentheses * * Given a string containing just the characters '(', ')', '{', '}', '[' and ']', ...
2，第二遍：熟悉。过easy题，记住；做medium，重点题背，反复背。最简单会，大多不会。记住做题套路...
此外，面试时的题目难度一般不超过Medium，将Easy和Medium的算法题目刷下来，并且将代码优化到最优解。基...
LeetCode Top 100 Liked Questions 437. Path Sum III (Java版; Easy) 题目描述 You 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 not need to start or end at the root or a leaf, but it must ...
LeetCode Top Interview Questions 29. Divide Two Integers (Java版; Medium) 题目描述 Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator. Return the quotient after dividing dividend by divisor. ...
0013 Roman to Integer Go 58.2% Easy 0014 Longest Common Prefix Go 40.7% Easy 0015 3Sum Go 32.2% Medium 0016 3Sum Closest Go 46.2% Medium 0017 Letter Combinations of a Phone Number Go 55.5% Medium 0018 4Sum Go 36.5% Medium 0019 Remove Nth Node From End of List Go 39.9% Medium...
136 Single Number C++ Python O(n) O(1) Easy 137 Single Number II C++ Python O(n) O(1) Medium 190 Reverse Bits C++ Python O(1) O(1) Easy 191 Number of 1 Bits C++ Python O(1) O(1) Easy 201 Bitwise AND of Numbers Range C++ Python O(1) O(1) Medium 231 Power of ...
3[反转链表](./card/top-interview-questions-easy/Linked List/fan-zhuan-lian-biao)Java Trees Sorting And Searching Dynamic Programming Design Math Others Top InterView Question Medium Top InterView Question Hard Study Plan Dynamic Programming 动态规划 ...