全部新建

登录

所有 Gists

evasquare / maxArea.java

0 喜欢

0 派生

1 文件

最后活跃于 1753612015

1	// https://leetcode.com/problems/container-with-most-water
2
3	class Solution {
4
5	public int maxArea(int[] height) {
6	var result = 0;
7
8	var left = 0;
9	var right = height.length - 1;

evasquare / stringToIntegerAtoi.java

0 喜欢

0 派生

1 文件

最后活跃于 1753526094

1	// https://leetcode.com/problems/string-to-integer-atoi/
2
3	class Solution {
4
5	public int myAtoi(String s) {
6	if (s == null \|\| s.length() == 0) {
7	return 0;
8	}
9
10	var chars = s.toCharArray();

evasquare / LongestPalindromicSubstring.java

0 喜欢

0 派生

1 文件

最后活跃于 1752478220

1	// Problem: https://leetcode.com/problems/longest-palindromic-substring/
2	// Explanation: https://youtu.be/XYQecbcd6_c
3
4	class Solution {
5	public String longestPalindrome(String s) {
6	var result = "";
7	var resultLength = 0;
8
9	for (int i = 0; i < s.length(); i++) {
10	// Odd length

evasquare / AddTwoNumbers.java

0 喜欢

0 派生

1 文件

最后活跃于 1751656852

1	// https://leetcode.com/problems/add-two-numbers
2	class Solution {
3
4	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
5	BigInteger sumOfParsedNumbers = getReverseNumber(l1).add(getReverseNumber(l2));
6
7	ListNode newListNode = new ListNode();
8	ListNode currentlyReadingNode = newListNode;
9
10	char[] chars = String.valueOf(sumOfParsedNumbers).toCharArray();

evasquare / hello_world.rs

0 喜欢

0 派生

1 文件

最后活跃于 1751608076

1	fn main() {
2	println!("Hello, World!");
3	}

上一页下一页

由 Opengist 强力驱动 ⋅ Load: 75ms⋅

中文