leetcode
肖冬禹想要拿OFFER
人生已如此悲惨,只求能去湾区养老。。。
展开
-
Leetcode 9. Palindrome Number
class Solution { public boolean isPalindrome(int x) { if (x < 0) { return false; } else if (x == 0) { return true; } else { String num = String.valueOf(x); int start = 0; ...原创 2021-08-22 14:49:05 · 175 阅读 · 0 评论 -
Leetcode Reverse Integer
class Solution { public int reverse(int x) { StringBuilder res = new StringBuilder(); boolean flag = false; if (x < 0) { flag = true; x *= -1; } if (x == 0) { return x; ...原创 2021-08-22 14:41:18 · 136 阅读 · 0 评论 -
Leetcode Two Sum
public class TwoSum { public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> mem = new HashMap<>(); for (int i = 0; i < nums.length; i++) { if (mem.containsKey(target - nums[i])) { .原创 2021-08-22 13:06:58 · 145 阅读 · 0 评论 -
659. Split Array into Consecutive Subsequences
You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subsequences consist of at least 3 consecutive integers....原创 2019-04-02 08:15:35 · 245 阅读 · 0 评论 -
416. Partition Equal Subset Sum
Given anon-emptyarray containingonly positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal. Note: Each of the array eleme...原创 2019-03-27 13:24:03 · 151 阅读 · 0 评论 -
leetcode 621. Task Scheduler
Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks. Tasks could be done without original order. Each task could ...原创 2019-03-27 06:21:15 · 169 阅读 · 0 评论 -
LeetCode 241. Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are+,-and*. Example 1: Inp...原创 2019-03-27 01:44:35 · 176 阅读 · 0 评论 -
39. Combination Sum
https://leetcode.com/problems/combination-sum/ Given asetof candidate numbers (candidates)(without duplicates)and a target number (target), find all unique combinations incandidateswhere the ca...原创 2019-03-15 05:33:16 · 174 阅读 · 0 评论 -
46. Permutations
经典题了 https://leetcode.com/problems/permutations/ Given a collection ofdistinctintegers, return all possible permutations. Example: Input: [1,2,3] Output: [ [1,2,3], [1,3,2], [2,1,3], [2...原创 2019-03-15 02:23:09 · 176 阅读 · 0 评论 -
17. Letter Combinations of a Phone Number
https://leetcode.com/problems/letter-combinations-of-a-phone-number/ Given a string containing digits from2-9inclusive, return all possible letter combinations that the number could represent. A m...原创 2019-03-15 01:39:06 · 177 阅读 · 0 评论 -
22. Generate Parentheses
https://leetcode.com/problems/generate-parentheses/ Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, givenn= 3, a solution set i...原创 2019-03-15 01:12:24 · 186 阅读 · 0 评论 -
[LeetCode] Binary Tree Preorder Traversal 二叉树的先序遍历
我不讨厌算法不讨厌算法,才见了鬼。Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,null,2,3}, 1 \ 2 / 3 return [1,2,3].Note: Recursive solutio...原创 2018-03-22 12:36:23 · 217 阅读 · 0 评论