2016年7月10日
find-k-pairs-with-smallest-sums
摘要： // https://discuss.leetcode.com/topic/50527/java-10ms-solution-no-priority-queue class Solution { public: vector> kSmallestPairs(vector& nums1, vector& nums2, int k) { sort(nums1.begin()... 阅读全文
posted @ 2016-07-10 15:00 blcblc 阅读(213) 评论(0) 推荐(0)
super-pow
摘要： // https://discuss.leetcode.com/topic/50489/c-clean-and-short-solution class Solution { int base = 1337; int powMod(int a, int b) { a %= base; int result = 1; for (in... 阅读全文
posted @ 2016-07-10 14:10 blcblc 阅读(193) 评论(0) 推荐(0)