li_super的博客

Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lin

class Solution { private static final double E = 0.0001; public boolean judgePoint24(int[] nums) { if (nums == null || nums.length != 4) { return false; ...

public class Solution { int result = 0; public int findTilt(TreeNode root) { postOrder(root); return result; } private int postOrder(TreeNode root) { ...

https://leetcode.com/problems/roman-to-integer public static int singleCharToInt(char ch) { int num = 0; switch (ch) { case 'I': num = 1; break; case 'V': num = 5; break; case '...

Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this...

题目来源 public boolean isPalindrome(int x){ /* 回文数 */ boolean flag = true; String sx = String.valueOf(x); if(sx.length() == 0) return false; Character sign = sx...