sunnykema的专栏

395. Longest Substring with At Least K Repeating Characters   Question Editorial Solution  My Submissions Total Accepted: 2080Total Submissions: 6509Difficulty: Medium Fi

1. Two Sum   Question Editorial Solution  My Submissions Total Accepted: 292841Total Submissions: 1111211Difficulty: Easy Given an array of integers, return indices of

2. Add Two Numbers   Question Editorial Solution  My Submissions Total Accepted: 177453Total Submissions: 714115Difficulty: Medium You are given two linked lists re

3. Longest Substring Without Repeating Characters   Question Editorial Solution  My Submissions Total Accepted: 184514Total Submissions: 798932Difficulty: Medium Gi

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Input: "babad" Output: "bab" Note: "aba" is also a valid answer.

public String convert(String s, int numRows) { char arr[] = s.toCharArray(); if(numRows < 2){ return s; } StringBuilder sb = new StringBuilder(); for(int i = 0; i < n

Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here are some good questions to ask before c

回文数不错的思路 public boolean isPalindrome(int x) { if(x < 0){ return false; } int div = 1; while( x / div >= 10){ div *= 10; } wh