摘要：
https://leetcode.com/problems/binary-tree-level-order-traversal-ii/#/description 阅读全文
posted @ 2017-04-19 23:12
Sempron2800+
阅读(98)
评论(0)
推荐(0)
摘要：
public class Solution { public int HammingWeight(uint n) { var list = new List<uint>(); do { var x = n % 2; list.Add(x); n = n / 2; } while (n != 0); 阅读全文
posted @ 2017-04-19 21:59
Sempron2800+
阅读(114)
评论(0)
推荐(0)
摘要：
public class Solution { public int Reverse(int x) { int fuhao = 1; if (x < 0) { fuhao = -1; } try { x = Math.Abs(x); } catch (Exception e) { return 0; 阅读全文
posted @ 2017-04-19 11:53
Sempron2800+
阅读(200)
评论(0)
推荐(0)
摘要：
方案一：算法思想：两层循环。时间负责度：O(n^2)，空间复杂度O(1)。代码使用C#实现： 1 public class Solution 2 { 3 public int[] TwoSum(int[] nums, int target) 4 { 5 var ary = new int[2]; 6 阅读全文
posted @ 2017-04-19 11:52
Sempron2800+
阅读(1395)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/maximum-subarray/#/description 补充一个python的实现： 算法思路：贪心法。 阅读全文
posted @ 2017-04-19 11:47
Sempron2800+
阅读(211)
评论(0)
推荐(0)
摘要：
public class Solution { public int ClimbStairs(int n) { //递归方法，效率低 //if (n <= 0) //{ // return 0; //} //else if (n == 1) //{ // return 1; //} //else i 阅读全文
posted @ 2017-04-19 11:46
Sempron2800+
阅读(196)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/path-sum-iii/#/description 补充一个python实现，使用递归： 这种实现的时间复杂度是O(n^2)，执行效率比较低。 再补充一个更高效的实现，使用hash表进行缓存：（如果必须符合这个时间复杂度的要求O(n)，就 阅读全文
posted @ 2017-04-19 11:44
Sempron2800+
阅读(146)
评论(0)
推荐(0)
摘要：
public class Solution { public int SearchInsert(int[] nums, int target) { for (int i = 0; i < nums.Length; i++) { if (nums[i] >= target) { return i; } 阅读全文
posted @ 2017-04-19 11:42
Sempron2800+
阅读(156)
评论(0)
推荐(0)
摘要：
/** * Definition for singly-linked list. * public class ListNode { * public int val; * public ListNode next; * public ListNode(int x) { val = x; } * } 阅读全文
posted @ 2017-04-19 11:40
Sempron2800+
阅读(167)
评论(0)
推荐(0)
摘要：
public class Solution { public bool IsPowerOfTwo(int n) { return ((n & (n - 1)) == 0 && n > 0); } } https://leetcode.com/problems/power-of-two/#/descr 阅读全文
posted @ 2017-04-19 11:39
Sempron2800+
阅读(136)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/power-of-three/#/description 使用循环实现，python 阅读全文
posted @ 2017-04-19 11:38
Sempron2800+
阅读(159)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/happy-number/#/description 补充一个python的实现： 使用集合s记录已经出现过的数字： 如果出现数字1，则返回True； 如果在出现重复的数字之前都没有出现过1，则返回False。 阅读全文
posted @ 2017-04-19 11:37
Sempron2800+
阅读(155)
评论(0)
推荐(0)
摘要：
public class Solution { public int MaxProfit(int[] prices) { //寻找最优极值点（包括2个端点) if (prices.Length < 2) { return 0; } else if (prices.Length == 2) { ret 阅读全文
posted @ 2017-04-19 11:36
Sempron2800+
阅读(186)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/convert-a-number-to-hexadecimal/#/description 阅读全文
posted @ 2017-04-19 11:35
Sempron2800+
阅读(210)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/add-strings/#/description 阅读全文
posted @ 2017-04-19 11:33
Sempron2800+
阅读(220)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/diameter-of-binary-tree/#/description 补充一种递归的方式，使用python实现： 思路是每次递归判断，以当前节点为根节点是否能达到最大，见第14行。 而每次递归向上返回的是当前节点的左右子树的高度的更大 阅读全文
posted @ 2017-04-19 11:32
Sempron2800+
阅读(217)
评论(0)
推荐(0)
摘要：
/** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNode left; * public TreeNode right; * public TreeNod 阅读全文
posted @ 2017-04-19 11:32
Sempron2800+
阅读(137)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/student-attendance-record-i/#/description 阅读全文
posted @ 2017-04-19 11:30
Sempron2800+
阅读(171)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/reverse-string-ii/#/description 阅读全文
posted @ 2017-04-19 11:29
Sempron2800+
阅读(173)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/number-of-boomerangs/#/description 阅读全文
posted @ 2017-04-19 11:28
Sempron2800+
阅读(249)
评论(0)
推荐(0)
摘要：
public class Solution { public int MissingNumber(int[] nums) { var list = nums.OrderBy(x => x).ToList(); var preNum = 0; foreach (var l in list) { if 阅读全文
posted @ 2017-04-19 11:28
Sempron2800+
阅读(150)
评论(0)
推荐(0)
摘要：
public class Solution { public int[] Intersect(int[] nums1, int[] nums2) { var len1 = nums1.Length; var len2 = nums2.Length; var list = new List<int>( 阅读全文
posted @ 2017-04-19 11:27
Sempron2800+
阅读(131)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/reverse-linked-list/#/description 简化的代码： 补充一个python的实现： 阅读全文
posted @ 2017-04-19 11:25
Sempron2800+
阅读(156)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/binary-watch/#/description 阅读全文
posted @ 2017-04-19 11:24
Sempron2800+
阅读(198)
评论(0)
推荐(0)
摘要：
public class Solution { private int ChangeToInt(char c) { var number = 0; string s = c.ToString(); switch (s) { case "I": number = 1; break; case "V": 阅读全文
posted @ 2017-04-19 11:24
Sempron2800+
阅读(155)
评论(0)
推荐(0)
摘要：
public class Solution { public bool ContainsDuplicate(int[] nums) { var list = nums.Distinct(); if (list.Count() == nums.Length) { return false; } els 阅读全文
posted @ 2017-04-19 11:23
Sempron2800+
阅读(158)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/longest-palindrome/#/description 阅读全文
posted @ 2017-04-19 11:22
Sempron2800+
阅读(116)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/base-7/#/description 阅读全文
posted @ 2017-04-19 11:21
Sempron2800+
阅读(138)
评论(0)
推荐(0)
摘要：
public class Solution { public bool IsAnagram(string s, string t) { Dictionary<char, int> dic = new Dictionary<char, int>(); foreach (var c in s) { if 阅读全文
posted @ 2017-04-19 11:20
Sempron2800+
阅读(196)
评论(0)
推荐(0)
摘要：
public class Solution { public int MajorityElement(int[] nums) { Dictionary<int, int> dic = new Dictionary<int, int>(); var len = nums.Length; for (in 阅读全文
posted @ 2017-04-19 11:19
Sempron2800+
阅读(266)
评论(0)
推荐(0)
摘要：
/** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNode left; * public TreeNode right; * public TreeNod 阅读全文
posted @ 2017-04-19 11:18
Sempron2800+
阅读(184)
评论(0)
推荐(0)
摘要：
/** * Definition for singly-linked list. * public class ListNode { * public int val; * public ListNode next; * public ListNode(int x) { val = x; } * } 阅读全文
posted @ 2017-04-19 11:17
Sempron2800+
阅读(142)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/excel-sheet-column-number/#/description 补充一个python的实现： 阅读全文
posted @ 2017-04-19 11:16
Sempron2800+
阅读(226)
评论(0)
推荐(0)
摘要：
public class Solution { public int MaxProfit(int[] prices) { var list = new List<KeyValuePair<int, int>>(); //记录所有的极大值和极小值 if (prices.Length <= 1) { r 阅读全文
posted @ 2017-04-19 11:15
Sempron2800+
阅读(201)
评论(0)
推荐(0)
摘要：
public class Solution { public int FirstUniqChar(string s) { Dictionary<char, int> dic = new Dictionary<char, int>(); foreach (char c in s) { if (!dic 阅读全文
posted @ 2017-04-19 11:14
Sempron2800+
阅读(176)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/sum-of-left-leaves/#/description 补充一个python的实现： 阅读全文
posted @ 2017-04-19 11:13
Sempron2800+
阅读(99)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/intersection-of-two-arrays/#/description 阅读全文
posted @ 2017-04-19 11:12
Sempron2800+
阅读(88)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/ransom-note/#/description 阅读全文
posted @ 2017-04-19 11:11
Sempron2800+
阅读(177)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/minimum-moves-to-equal-array-elements/#/description 阅读全文
posted @ 2017-04-19 11:10
Sempron2800+
阅读(126)
评论(0)
推荐(0)
摘要：
public class Solution { public int FindContentChildren(int[] g, int[] s) { var listg = g.OrderBy(x => x).ToList(); var lists = s.OrderBy(x => x).ToLis 阅读全文
posted @ 2017-04-19 11:09
Sempron2800+
阅读(118)
评论(0)
推荐(0)
摘要：
public class Solution { public int[] TwoSum(int[] numbers, int target) { Dictionary<int, int> dic = new Dictionary<int, int>(); int count = numbers.Co 阅读全文
posted @ 2017-04-19 11:08
Sempron2800+
阅读(133)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/relative-ranks/#/description 阅读全文
posted @ 2017-04-19 11:07
Sempron2800+
阅读(152)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/minimum-absolute-difference-in-bst/#/description 阅读全文
posted @ 2017-04-19 11:06
Sempron2800+
阅读(128)
评论(0)
推荐(0)
摘要：
public class Solution { public void MoveZeroes(int[] nums) { int index = 0; for (int i = 0; i < nums.Length; i++) { //[0, 1, 0, 3, 12] //[1, 3, 12, 0, 阅读全文
posted @ 2017-04-19 11:06
Sempron2800+
阅读(147)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/longest-uncommon-subsequence-i/#/description 阅读全文
posted @ 2017-04-19 11:04
Sempron2800+
阅读(130)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/construct-the-rectangle/#/description 阅读全文
posted @ 2017-04-19 11:04
Sempron2800+
阅读(122)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/add-digits/#/description 阅读全文
posted @ 2017-04-19 11:03
Sempron2800+
阅读(110)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/invert-binary-tree/#/description 补充一个使用层次遍历处理的方案，java实现 补充一个python的实现： 阅读全文
posted @ 2017-04-19 11:02
Sempron2800+
阅读(142)
评论(0)
推荐(0)
摘要：
public class Solution { public int GetSum(int a, int b) { return b == 0 ? a : GetSum(a ^ b, (a & b) << 1); } } https://leetcode.com/problems/sum-of-tw 阅读全文
posted @ 2017-04-19 11:00
Sempron2800+
阅读(129)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/find-the-difference/#/description 阅读全文
posted @ 2017-04-19 10:59
Sempron2800+
阅读(123)
评论(0)
推荐(0)
摘要：
/** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNode left; * public TreeNode right; * public TreeNod 阅读全文
posted @ 2017-04-19 10:59
Sempron2800+
阅读(127)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/#/description 阅读全文
posted @ 2017-04-19 10:58
Sempron2800+
阅读(140)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/detect-capital/#/description 阅读全文
posted @ 2017-04-19 10:57
Sempron2800+
阅读(131)
评论(0)
推荐(0)
摘要：
public class Solution { public int SingleNumber(int[] nums) { Dictionary<int, int> dic = new Dictionary<int, int>(); foreach (var n in nums) { if (!di 阅读全文
posted @ 2017-04-19 10:56
Sempron2800+
阅读(228)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/nim-game/#/description 阅读全文
posted @ 2017-04-19 10:55
Sempron2800+
阅读(112)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/max-consecutive-ones/#/description 阅读全文
posted @ 2017-04-19 10:55
Sempron2800+
阅读(112)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/island-perimeter/#/description 阅读全文
posted @ 2017-04-19 10:54
Sempron2800+
阅读(150)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/next-greater-element-i/#/description 阅读全文
posted @ 2017-04-19 10:53
Sempron2800+
阅读(185)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/reverse-string/#/description 下面是使用C++的解决方案，不实用api： 这道题目有所变化，原来的要求是返回string，现在的要求是不返回任何值，而是在原来的字符串上直接修改。 下面使用python实现新的要求 阅读全文
posted @ 2017-04-19 10:52
Sempron2800+
阅读(136)
评论(0)
推荐(0)
摘要：
public class Solution { public IList<string> FizzBuzz(int n) { var list = new List<string>(); for (int i = 1; i <= n; i++) { if (i % 15 == 0) { list.A 阅读全文
posted @ 2017-04-19 10:51
Sempron2800+
阅读(132)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/keyboard-row/#/description 阅读全文
posted @ 2017-04-19 10:50
Sempron2800+
阅读(194)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/number-complement/#/description 阅读全文
posted @ 2017-04-19 10:48
Sempron2800+
阅读(127)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/reverse-words-in-a-string-iii/#/description 阅读全文
posted @ 2017-04-19 10:46
Sempron2800+
阅读(110)
评论(0)
推荐(0)
摘要：
public class Solution { public int HammingDistance(int x, int y) { int[] aryA = new int[32]; int[] aryB = new int[32]; int i = 0; int j = 0; do { aryA 阅读全文
posted @ 2017-04-19 10:45
Sempron2800+
阅读(137)
评论(0)
推荐(0)
浙公网安备 33010602011771号