上一页 1 ··· 48 49 50 51 52 53 54 55 56 ··· 87 下一页
摘要: https://leetcode.com/problems/longest-common-prefix/description/ Write a function to find the longest common prefix string amongst an array of strings 阅读全文
posted @ 2018-11-02 21:36 丧心病狂工科女 阅读(118) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/roman-to-integer/description/ Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For exa 阅读全文
posted @ 2018-11-02 21:17 丧心病狂工科女 阅读(95) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/palindrome-number/description/ Determine whether an integer is a palindrome. An integer is a palindrome when it reads th 阅读全文
posted @ 2018-11-02 21:16 丧心病狂工科女 阅读(124) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/reverse-integer/description/ Given a 32-bit signed integer, reverse digits of an integer. Example 1: Example 2: Example 阅读全文
posted @ 2018-11-02 21:14 丧心病狂工科女 阅读(96) 评论(0) 推荐(0) 编辑
摘要: http://poj.org/problem?id=3660 N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows 阅读全文
posted @ 2018-11-02 13:14 丧心病狂工科女 阅读(302) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/two-sum/description/ Given an array of integers, return indices of the two numbers such that they add up to a specific t 阅读全文
posted @ 2018-11-01 19:23 丧心病狂工科女 阅读(137) 评论(0) 推荐(0) 编辑
摘要: http://poj.org/problem?id=3734 Description Panda has received an assignment of painting a line of blocks. Since Panda is such an intelligent boy, he s 阅读全文
posted @ 2018-10-30 20:10 丧心病狂工科女 阅读(233) 评论(0) 推荐(0) 编辑
摘要: http://poj.org/problem?id=3268 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party 阅读全文
posted @ 2018-10-30 20:07 丧心病狂工科女 阅读(197) 评论(0) 推荐(0) 编辑
摘要: http://poj.org/problem?id=2253 Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on 阅读全文
posted @ 2018-10-30 20:05 丧心病狂工科女 阅读(162) 评论(0) 推荐(0) 编辑
摘要: #include using namespace std; const int mod = 1e9 + 7; int N; struct Matrix{ long long m[2][2]; }; Matrix Mul(Matrix A, Matrix B) { Matrix ret; for(int i = 0; i < 2; i ++) { f... 阅读全文
posted @ 2018-10-30 14:22 丧心病狂工科女 阅读(230) 评论(0) 推荐(0) 编辑
上一页 1 ··· 48 49 50 51 52 53 54 55 56 ··· 87 下一页