摘要：
public class Solution { public int DominantIndex(int[] nums) { var list = new List>(); for (int i = 0; i (i, nums[i])); } var olis... 阅读全文
posted @ 2018-10-01 11:58
Sempron2800+
阅读(91)
评论(0)
推荐(0)
摘要：
public class Solution { public string LongestWord(string[] words) { var maxlist = new List(); var dic = new Dictionary(); Queue Q = new Qu... 阅读全文
posted @ 2018-10-01 11:40
Sempron2800+
阅读(119)
评论(0)
推荐(0)
摘要：
class Solution { public: vector V; void postTree(TreeNode* node) { if (node != NULL) { V.push_back(node->val); if (node->left != NULL) ... 阅读全文
posted @ 2018-10-01 09:48
Sempron2800+
阅读(98)
评论(0)
推荐(0)
摘要：
大体思路是正确的，有些细节没有考虑清楚。参考了网上的答案进行了修正。 阅读全文
posted @ 2018-10-01 09:32
Sempron2800+
阅读(122)
评论(0)
推荐(0)
摘要：
public class Solution { public char NextGreatestLetter(char[] letters, char target) { //a-97 z-122 var dic = new List>(); //key存储当前值，int是下一个值 ... 阅读全文
posted @ 2018-10-01 08:36
Sempron2800+
阅读(125)
评论(0)
推荐(0)
浙公网安备 33010602011771号