咖啡中不塌缩的方糖

2016年8月24日

摘要： Determine whether an integer is a palindrome. Do this without extra space. Solution: 阅读全文

posted @ 2016-08-24 05:00 咖啡中不塌缩的方糖阅读(288) 评论(0) 推荐(0) 编辑

摘要： The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font 阅读全文

posted @ 2016-08-24 04:25 咖啡中不塌缩的方糖阅读(403) 评论(0) 推荐(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, and there exists one unique longes 阅读全文

posted @ 2016-08-24 02:59 咖啡中不塌缩的方糖阅读(133) 评论(0) 推荐(0) 编辑

2016年8月19日

Leetcode 159 Longest Substring with At Most Two Distinct Characters

摘要： Given a string, find the length of the longest substring T that contains at most 2 distinct characters. For example, Given s = “eceba”, T is "ece" whi 阅读全文

posted @ 2016-08-19 12:23 咖啡中不塌缩的方糖阅读(152) 评论(0) 推荐(0) 编辑

2016年8月18日

Leetcode 1 Two Sum

摘要： Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ex 阅读全文

posted @ 2016-08-18 01:26 咖啡中不塌缩的方糖阅读(141) 评论(0) 推荐(0) 编辑

Leetcode 15 3Sum

摘要： Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of 阅读全文

posted @ 2016-08-18 01:25 咖啡中不塌缩的方糖阅读(139) 评论(0) 推荐(0) 编辑

Leetcode 383 Ransom Note

摘要： Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the rans 阅读全文

posted @ 2016-08-18 00:04 咖啡中不塌缩的方糖阅读(236) 评论(0) 推荐(0) 编辑

咖啡中不塌缩的方糖

公告