随笔分类 -  Algorithm

摘要：LeetCode OJ 5: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 阅读全文

摘要：LeetCode OJ 4:There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time 阅读全文

摘要：LeetCode OJ 3: Given a string, find the length of the longest substring without repeating characters. Given "abcabcbb", the answer is "abc", which the 阅读全文

摘要：LeetCode OJ 2:You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes con 阅读全文

摘要：LeetCode OJ 371：Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. 思路：在不使用运算符求和的问题中，最容易想到的一种方法是借助与、异或和移位操 阅读全文