诗云panther
诗云panther
全部文章
题解
生活 篮球(1)
归档
标签
去牛客网
登录
/
注册
诗云panther的博客
全部文章
/ 题解
(共80篇)
题解 | #求连续子数组的最大和#
include<stdio.h> int max(int a,int b){ return a>b?a:b;}int main(){ int in[10000]; int n=0; bool isAll_=true; do{ scanf(...
2021-08-29
2
621
题解 | #最小代价爬楼梯#
include include using namespace std;int main(){ vector<int> cost; int c; while(scanf("%d,", &c) > 0){ cost.push...
2021-08-29
2
601
题解 | #公交车#
include include include using namespace std; int main(){ int a, b, inte, mod; cin >> a >> b; inte = a / b, mod = a % b; if(...
2021-08-29
1
515
题解 | #跳石板#
import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader; public class Main { public static void main(String[] arg...
2021-08-24
3
598
题解 | #最长递增子序列(LCS)#
include <stdio.h> void _printf(int x){ if(x>=0 && x<=9) printf("%d",x); else { printf("%d&q...
2021-08-23
3
495
题解 | #数列还原#
include include using namespace std; struct Tree{ int val; Tree *left, *right; Tree(int val):val(val), left(NULL), right(NULL){}}; Tree *Buil...
2021-08-23
2
607
题解 | #最大报销额#
include <stdio.h> include <string.h> struct Info1{ double hash[300]; double tot; int flag;}; struct Info1 fapiao[35]; double maxi...
2021-08-21
2
662
题解 | #搅乱字符串#
class Solution {public: bool isScramble(string s1, string s2) { if(s1 == s2) return true; int c[26] = {0}; for(int ...
2021-08-21
2
602
题解 | #找出最长不重复字符的子串#
class Solution {public: /** * * @param s string字符串 * @return int整型 */ int lengthOfLongestSubstring(string s) { // write c...
2021-08-21
3
584
题解 | #加一#
class Solution {public: /* * * @param A int整型一维数组 * @param n int A数组长度 * @param target int整型 * @return int整型vector */ ve...
2021-08-21
3
550
首页
上一页
1
2
3
4
5
6
7
8
下一页
末页