2017年6月23日
[LintCode] First Position Unique Character
摘要： Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Given a string, find the first non 阅读全文
posted @ 2017-06-23 01:13 Review->Improve 阅读(709) 评论(0) 推荐(0) 编辑
[LintCode] Integer to Roman
摘要： Given an integer, convert it to a roman numeral. The number is guaranteed to be within the range from 1 to 3999. Given an integer, convert it to a rom 阅读全文
posted @ 2017-06-23 00:50 Review->Improve 阅读(167) 评论(0) 推荐(0) 编辑
[LintCode] Roman to Integer
摘要： Given a roman numeral, convert it to an integer. The answer is guaranteed to be within the range from 1 to 3999. Given a roman numeral, convert it to 阅读全文
posted @ 2017-06-23 00:33 Review->Improve 阅读(176) 评论(0) 推荐(0) 编辑
2017年6月21日
[LintCode] Jump Game II
摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2017-06-21 14:40 Review->Improve 阅读(459) 评论(0) 推荐(0) 编辑
[LintCode] Jump Game
摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2017-06-21 13:22 Review->Improve 阅读(374) 评论(0) 推荐(0) 编辑
[LintCode] Set Matrix Zeros
摘要： Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Given a m x n matrix, if an element is 0, set its entire 阅读全文
posted @ 2017-06-21 00:35 Review->Improve 阅读(175) 评论(0) 推荐(0) 编辑
2017年6月20日
[LintCode] Identify Celebrity
摘要： Suppose you are at a party with n people (labeled from 0 to n - 1) and among them, there may exist one celebrity. The definition of a celebrity is tha 阅读全文
posted @ 2017-06-20 07:49 Review->Improve 阅读(431) 评论(0) 推荐(0) 编辑
[LintCode] Edit Distance
摘要： Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have 阅读全文
posted @ 2017-06-20 05:26 Review->Improve 阅读(228) 评论(0) 推荐(0) 编辑
[LintCode] Edit Distance II
摘要： Given two strings S and T, determine if they are both one edit distance apart. There are three types of edits that can be performed on strings: insert 阅读全文
posted @ 2017-06-20 05:26 Review->Improve 阅读(576) 评论(0) 推荐(0) 编辑
2017年6月18日
[LintCode] Strings Serialization
摘要： Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list 阅读全文
posted @ 2017-06-18 06:01 Review->Improve 阅读(402) 评论(0) 推荐(0) 编辑