码迷,mamicode.com
首页 >  
搜索关键字:light oj    ( 5088个结果
CSS 字体
华文细黑:STHeiti Light [STXihei]华文黑体:STHeiti华文楷体:STKaiti华文宋体:STSong华文仿宋:STFangsong俪黑 Pro:LiHei Pro Medium俪宋 Pro:LiSong Pro Light标楷体:BiauKai苹果俪中黑:Apple LiG...
分类:Web程序   时间:2014-06-15 22:38:24    阅读次数:260
[leetcode]Minimum Window Substring @ Python
原题地址:https://oj.leetcode.com/problems/minimum-window-substring/题意:Given a string S and a string T, find the minimum window in S which will contain all...
分类:编程语言   时间:2014-06-15 22:10:42    阅读次数:1109
[leetcode]Merge Two Sorted Lists @ Python
原题地址:https://oj.leetcode.com/problems/merge-two-sorted-lists/题意:Merge two sorted linked lists and return it as a new list. The new list should be made...
分类:编程语言   时间:2014-06-15 21:58:31    阅读次数:238
[leetcode]Permutation Sequence @ Python
原题地址:https://oj.leetcode.com/submissions/detail/5341904/题意:The set[1,2,3,…,n]contains a total ofn! unique permutations.By listing and labeling all of ...
分类:编程语言   时间:2014-06-15 21:33:16    阅读次数:270
[leetcode]Reverse Nodes in k-Group @ Python
原题地址:https://oj.leetcode.com/problems/reverse-nodes-in-k-group/题意:Given a linked list, reverse the nodes of a linked listkat a time and return its mod...
分类:编程语言   时间:2014-06-15 21:24:43    阅读次数:293
[leetcode]Longest Substring Without Repeating Characters @ Python
原题地址:https://oj.leetcode.com/problems/longest-substring-without-repeating-characters/题意:Given a string, find the length of the longest substring witho...
分类:编程语言   时间:2014-06-15 19:51:00    阅读次数:254
LeetCode OJ--Permutation Sequence *
求第k个排列。刚开始按照一个排列一个排列的求,超时。于是演算了一下,发下有数学规律,其实就是康托解码。康托展开:全排列到一个自然数的双射X=an*(n-1)!+an-1*(n-2)!+...+ai*(i-1)!+...+a2*1!+a1*0!ai为整数,并且0 fractial; fr...
分类:其他好文   时间:2014-06-15 07:13:59    阅读次数:192
[leetcode]Add Two Numbers @ Python
原题地址:https://oj.leetcode.com/problems/add-two-numbers/题意:You are given two linked lists representing two non-negative numbers. The digits are stored i...
分类:编程语言   时间:2014-06-15 00:40:44    阅读次数:328
NOJ--1046--dfs
刚刚A了那题之后 想到以前自己的OJ那边有个整数划分...同时 tz 那边也有个很相似的 我是做了TZ的再做了自己OJ的 一起 放上链接 touch me touch me其实 我们解决的问题 应该主要是 字典序的输出和不能重复的输出就是说 1+1+2出现了 那么1+2+1就不应该出现 -- ...
分类:其他好文   时间:2014-06-14 22:49:58    阅读次数:273
LeetCode OJ平台上Maximum Subarray题目O(n)复杂度解决方案
原始题目如下,意为寻找数组和最大的子串,返回这个最大和即可。 Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [?2,1,?3,4,?1,2,1,?5,4], the...
分类:其他好文   时间:2014-06-14 15:08:00    阅读次数:224
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!