- 博客(2)
- 收藏
- 关注
RSS订阅原创 菜鸟写leetcode03
暂时就想到一个暴力算法,运气好也通过了。public class Solution { public int lengthOfLongestSubstring(String s) { if(s==null||s.length()==0) return 0; int n=s.length();int max=1; loop:for(int i=0;i<n-1;
2017-04-10 21:56:32
117
原创 菜鸟写LEETCODE题解
菜鸟刷题为了能够多思考多交流 LEETCODE原题如下： 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 contain a single digit. Add the two
2017-04-07 14:18:14
332
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人