leetcode
文章平均质量分 69
sunnykema
这个作者很懒,什么都没留下…
展开
-
leetcode 395. Longest Substring with At Least K Repeating Characters
395. Longest Substring with At Least K Repeating Characters QuestionEditorial Solution My SubmissionsTotal Accepted: 2080Total Submissions: 6509Difficulty: MediumFi原创 2016-09-11 17:36:33 · 341 阅读 · 0 评论 -
leetcode 1. Two Sum
1. Two Sum QuestionEditorial Solution My SubmissionsTotal Accepted: 292841Total Submissions: 1111211Difficulty: EasyGiven an array of integers, return indices of原创 2016-09-11 18:10:03 · 210 阅读 · 0 评论 -
leetcode 2. Add Two Numbers
2. Add Two Numbers QuestionEditorial Solution My SubmissionsTotal Accepted: 177453Total Submissions: 714115Difficulty: MediumYou are given two linked lists re原创 2016-09-11 20:08:33 · 256 阅读 · 0 评论 -
leetcode 3. Longest Substring Without Repeating Characters
3. Longest Substring Without Repeating Characters QuestionEditorial Solution My SubmissionsTotal Accepted: 184514Total Submissions: 798932Difficulty: MediumGi原创 2016-09-13 08:53:55 · 237 阅读 · 0 评论 -
LeetCode 5. Longest Palindromic Substring
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.原创 2016-11-15 16:21:28 · 220 阅读 · 0 评论 -
6. ZigZag Conversion
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原创 2016-12-04 17:35:37 · 197 阅读 · 0 评论 -
leetCode 7. Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before c原创 2016-12-13 15:12:22 · 241 阅读 · 0 评论 -
leetcode 9. Palindrome Number
回文数不错的思路 public boolean isPalindrome(int x) { if(x < 0){ return false; } int div = 1; while( x / div >= 10){ div *= 10; } wh原创 2016-12-13 15:53:36 · 248 阅读 · 0 评论