摘要： 1、根据这篇文章https://wenku.baidu.com/view/55bf7f8db8f67c1cfad6b8bf.html修改CentOS-Base.repo文件（主要是修改baseurl为163的镜像源） 2、yum clean all 3、yum makecache 4、yum ins 阅读全文

摘要： 题目： 输入一棵二叉树，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。 链接： http://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b?tpId=13&tqId=11 阅读全文

摘要： 题目 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 complexity 阅读全文

摘要： 题目 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 lon 阅读全文

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

摘要： 题目 You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a sing 阅读全文

摘要： 题目： 228. Summary Ranges 228. Summary Ranges Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1 阅读全文

摘要： 题目： 273. Integer to English Words Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 阅读全文

摘要： 题目： Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any positive in 阅读全文

摘要： 题目 Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT 链接 https://leetcode.com/problems/div 阅读全文