随笔分类 -  LeetCode

leetcode：Single Number
摘要：public int SingleNumber(int[] nums) { if(nums==null||nums.Length%2==0) return 0; int ret=nums[0]; for(int i=1;i 超时了 阅读全文
posted @ 2015-09-28 18:18 darksied 阅读(119) 评论(0) 推荐(0)
LeetCode11：Container With Most Water
摘要：public int MaxArea(int[] height) { int start=0; int end=height.Length-1; int max=0; while(st... 阅读全文
posted @ 2015-09-05 20:32 darksied 阅读(125) 评论(0) 推荐(0)
leetcode 4：Median of Two Sorted Arrays
摘要：public double FindMedianSortedArrays(int[] nums1, int[] nums2) {int t=nums1.Length+nums2.Length; int mid1=0; int mid2=0; int i=0; int p1=0; ... 阅读全文
posted @ 2015-08-22 15:36 darksied 阅读(137) 评论(0) 推荐(0)
leetcode3:Longest Substring Without Repeating Characters
摘要：public int LengthOfLongestSubstring(string s) { Queue queue=new Queue(); int max=0; for(int i=0;i<s.Length;i++) { if(queue.Contain... 阅读全文
posted @ 2015-08-21 22:19 darksied 阅读(128) 评论(0) 推荐(0)
LeetCode264：Ugly Number II
摘要：自己的做法超时了。主要是每次生成一个数据，保存到list中，然后对List重新排序。排序太耗费时间记录下讨论组里的写法public int NthUglyNumber(int n) { int[] ugly = new int[n]; ugly[0] = 1; int i... 阅读全文
posted @ 2015-08-20 10:30 darksied 阅读(145) 评论(0) 推荐(0)
LeetCode263:Ugly Number
摘要：public bool IsUgly(int num) { if(num1) { if(num%2==0) { num=num/2; } else if(num%3==0) { num=num/3; } else if(n... 阅读全文
posted @ 2015-08-19 17:50 darksied 阅读(145) 评论(0) 推荐(0)
LeetCode112：Path Sum
摘要：正常写法bool HasPathSum(TreeNode root, int sum) { bool ret=false; if(root==null)return false; if(root.left==null&&root.right==null) return root.val=... 阅读全文
posted @ 2015-08-14 10:01 darksied 阅读(136) 评论(0) 推荐(0)
leetcode56：Merge Intervals
摘要：大都是自定义了Interval的比较方法。突发奇想int [] arr=new int[intervals.Count*2]; for(int i=0;i list=new List(); int s=0;//int e=1; int count=0; for(int i=0;... 阅读全文
posted @ 2015-08-12 12:03 darksied 阅读(169) 评论(0) 推荐(0)
LeetCode202:Happy Number 。C#版，在vs2010中通过，leetcode中Wrong Answer
摘要：static List nums = new List(); public static bool IsHappy(int n) { int newint = 0; while (n != 0) { ... 阅读全文
posted @ 2015-08-07 18:21 darksied 阅读(228) 评论(0) 推荐(0)