Keep Learning

摘要： package LeetCode_43 /** * 43. Multiply Strings * https://leetcode.com/problems/multiply-strings/ * Given two non-negative integers num1 and num2 repre 阅读全文

摘要： package _interview_question /** * You are given a list of non-negative integers. * Find the largest value of the expression you can get by using +, * 阅读全文

摘要： package LeetCode_1014 /** * 1014. Best Sightseeing Pair * https://leetcode.com/problems/best-sightseeing-pair/ * Given an array A of positive integers 阅读全文

摘要： package LeetCode_562 /** * 562. Longest Line of Consecutive One in Matrix * (Prime) *Given a 01 matrix M, find the longest line of consecutive one in 阅读全文

摘要： package LeetCode_561 /** * 561. Array Partition I * https://leetcode.com/problems/array-partition-i/ * Given an integer array nums of 2n integers, gro 阅读全文

摘要： hashCode()和equals()是什么？ hashCode()方法和equals()方法的作用其实是一样，在java里都是用来对比两个对象是否相等一致。 hashCode()和equals()的区别 我们从两个角度介绍他们的区别：1. 性能，2. 可靠性，他们之间的主要区别也基本体现在这里。 阅读全文

摘要： package LeetCode_1496 /** * 1496. Path Crossing * https://leetcode.com/problems/path-crossing/ * Given a string path, where path[i] = 'N', 'S', 'E' or 阅读全文

摘要： package LeetCode_1678 /** * 1678. Goal Parser Interpretation * https://leetcode.com/problems/goal-parser-interpretation/ * You own a Goal Parser that 阅读全文

摘要： package LeetCode_1694 import java.util.* /** * 1694. Reformat Phone Number * https://leetcode.com/problems/reformat-phone-number/ * You are given a ph 阅读全文

摘要： package _interview_question /** * Given a integer n, return all amicable paris * */ class Solution16 { /* * solution: get sum of divisors of number,Ti 阅读全文