摘要: Given a string, find the length of the longest substring without repeating characters. Examples: 解法: 建立一个大小为256整形数组,用来记录每个字符上一次出现的位置。longest记录最长的子串长度, 阅读全文
posted @ 2017-02-09 22:26 Strugglion 阅读(156) 评论(0) 推荐(0) 编辑
摘要: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contai 阅读全文
posted @ 2017-02-09 18:58 Strugglion 阅读(243) 评论(0) 推荐(0) 编辑
摘要: 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 @ 2017-02-09 16:05 Strugglion 阅读(396) 评论(0) 推荐(0) 编辑