上一页 1 2 3 4 5 6 7 8 9 10 ··· 17 下一页
摘要: https://leetcode.com/problems/single-element-in-a-sorted-array/description/ 阅读全文
posted @ 2018-11-18 12:58 JTechRoad 阅读(126) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/decode-string/description/ 阅读全文
posted @ 2018-11-18 01:13 JTechRoad 阅读(97) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/unique-paths-ii/description/ 阅读全文
posted @ 2018-11-16 14:53 JTechRoad 阅读(75) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/trim-a-binary-search-tree/description/ 阅读全文
posted @ 2018-11-14 16:02 JTechRoad 阅读(52) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/top-k-frequent-words/description/ 阅读全文
posted @ 2018-11-14 14:06 JTechRoad 阅读(74) 评论(0) 推荐(0) 编辑
摘要: Peatio: https://github.com/peatio/peatio ViaBTC: https://github.com/viabtc/viabtc_exchange_server 阅读全文
posted @ 2018-07-15 13:57 JTechRoad 阅读(259) 评论(0) 推荐(0) 编辑
摘要: https://crackstation.net/hashing-security.htm https://blog.csdn.net/LVXIANGAN/article/details/49201071 https://aidandai.github.io/posts/salt.html 阅读全文
posted @ 2018-07-08 14:32 JTechRoad 阅读(151) 评论(0) 推荐(0) 编辑
摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla... 阅读全文
posted @ 2018-06-10 08:00 JTechRoad 阅读(96) 评论(0) 推荐(0) 编辑
摘要: class Solution { public: int maxProfit(vector& prices, int fee) { int n = prices.size(); if (n <= 1) return 0; // s0: max profit when not holding any stock // s1: max pro... 阅读全文
posted @ 2018-06-03 15:26 JTechRoad 阅读(75) 评论(0) 推荐(0) 编辑
摘要: class Solution { public: bool validPalindrome(string s) { int i = 0, j = s.length() - 1; while (i < j) { if (s[i] == s[j]) { i++; j--; ... 阅读全文
posted @ 2018-06-01 22:56 JTechRoad 阅读(121) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 9 10 ··· 17 下一页