classSolution{publicStringlongestPalindrome(Strings){if(s==null||s.length()<1)return"";intstart=0;intend=0;for(inti=0;i<s.length();i++){intlen1=expandAroundCenter(s,i,i);//以一个字符为中心intlen2=expandAroundCenter(s,i,i+1);//以两个字符为中心intlen=Math.max(len1,len2);if(...
0442-find-all-duplicates-in-an-array 0443-string-compression 0491-non-decreasing-subsequences 0494-target-sum 0506-relative-ranks Leetcode-Solutions-In-Java Releases No releases published Packages No packages published Languages Java92.1% Python7.0% ...
#TitleSolutionDifficultyAnalysis 306 Additive Number Java Medium 305 Number of Islands II Java Hard 304 Range Sum Query 2D - Immutable Java Medium 303 Range Sum Query - Immutable Java Easy 302 Smallest Rectangle Enclosing Black Pixels Java Medium 300 Longest Increasing Subsequence Java Medium...
packagecom.yang.test;importjava.util.Arrays;/*** @date 2021/1/1320:32*/publicclassSolution {publicstaticvoidmain(String[] arg0){int[][] edges =newint[][]{{1,2},{2,3},{3,4},{1,4},{2,4},{1,3}}; Solution solution=newSolution();int[] target =solution.findRedundantConnection(...
class Solution { public int evalRPN(String[] tokens) { switch (tokens[i]){ case "+": numsStack.push(num2+num1); break; case "-": numsStack.push(num2-num1); break; case "*": numsStack.push(num2*num1); break; case "/": numsStack.push(num2/num1); break; } } } Input ...
* }*/importjava.util.HashMap;publicclassSolution {publicintmaxPoints(Point[] points) {if(points.length<=1)returnpoints.length;intmax = 0;for(inti =0;i<points.length;i++){ HashMap<Double, Integer> map =newHashMap<Double, Integer>();intsameX =1, sameP =0;for(intj =0;j<points.le...
int[][] rects; List<Integer> psum = new ArrayList<>(); int tot = 0; Random rand = new Random(); public Solution(int[][] rects) { this.rects = rects; for (int[] x : rects){ tot += (x[2] - x[0] + 1) * (x[3] - x[1] + 1); psum.add(tot); } } public...
下面的思路借鉴自讨论区(https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/discuss/91049/Java-O(n%29-solution-using-bit-manipulation-and-HashMap)的一个解法。现在 Medium 的题目居然也需要看解答了,叹气。 代码语言:javascript 代码运行次数:0 运行 复制 class Solution { public int...
https://leetcode.cn/problems/binary-tree-inorder-traversal/ 给定一个二叉树的根节点 root ,返回 它的中序 遍历。 class Solution { public: void dfs(TreeNode* root,vector<int>& res){ if(root==NULL){return;} dfs(root->left,res); res.push_back(root->val); dfs(root->right,res); } ...
田忌赛马(Python/Java/C++/Go) - 优势洗牌 - 力扣(LeetCode) Python: 代码语言:javascript 代码运行次数:0 运行 AI代码解释 class Solution: def advantageCount(self, nums1: List[int], nums2: List[int]) -> List[int]: n = len(nums1) ans = [0] * n #初始化一个长度为n的数组 nums1.sort...