菜鸡百里-CSDN博客

原创 leetcode19

题目描述给你一个链表，删除链表的倒数第 n 个结点，并且返回链表的头结点。进阶：你能尝试使用一趟扫描实现吗？示例 1：输入：head = [1,2,3,4,5], n = 2输出：[1,2,3,5]示例 2：输入：head = [1], n = 1输出：[]示例 3：输入：head = [1,2], n = 1输出：[1]来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/remove-nth-node-from-end-of-li

2021-07-13 10:19:46 85

原创 Java-句子逆序

import java.util.Scanner;public class Main{ public static void main(String args[]){ Scanner sc = new Scanner(System.in); String s = sc.nextLine(); String[] rev=s.split(" "); for (int i=rev.length-1;i>=0;i--){

2021-03-19 14:49:40 128

原创 1096

#include <iostream>using namespace std;int main(){ int A,C; cin >> A; for(int i = 0; i<A;i++){ cin>>C; int sum = 0; int D[1000]; for(int i = 0;i<C;i++){ cin>>D[i]; sum = sum + D[i]; } cout<<sum&lt

2021-03-04 19:01:54 72 1

原创 1001

#include <iostream>using namespace std;int main(){ int A; while(cin >> A) { int sum = 0; for(int i = 1;i<=A;i++){ sum = sum + i; } cout<<sum<<endl; cout<<endl; } }

2021-03-04 19:01:43 64 1

原创 2000ASCII码排序

#include <iostream>using namespace std;int main(){ char A,B,C,D; while(cin >> A >>B>>C) { if(A > B){ D=A; A=B; B=D; } if(B> C){ D=B; B=C; C=D; } if(A > C){ D=A; A=C; C=D; } if(

2021-03-04 19:01:31 98 1

原创 2001计算两点间的距离

#include <iostream>#include <cmath>#include <iomanip>using namespace std;int main(){ double x1,x2,y1,y2; while(cin>>x1>>y1>>x2>>y2){ cout<<fixed<< setprecision(2) <<sqrt(pow((y1-y2),2)+po

2021-03-04 19:00:49 93 1

原创 1094

#include <iostream>using namespace std;int main(){ int C; while(cin >> C){ int sum = 0; int D[1000]; for(int i = 0;i<C;i++){ cin>>D[i]; sum = sum + D[i]; } cout<<sum<<endl; sum = 0; } }

2021-03-04 16:19:41 125 1

原创杭电OJ-Problem-1093

#include <iostream>using namespace std;int main(){ int A,C; cin >> A; for(int i = 0; i<A;i++){ cin>>C; int sum = 0; int D[1000]; for(int i = 0;i<C;i++){ cin>>D[i]; sum = sum + D[i]; } cout<<sum&lt

2021-03-04 16:09:54 145 1

原创杭电OJ-Problem-1092

#include <iostream>using namespace std;int main(){ int A,B,C; cin >> C; while(C!=0){ for(int i = 0;i < C;i++){ int D[1000]; int sum = 0; for(int i = 0;i<C;i++){ cin>>D[i]; sum = sum + D[i]; } cout<&l

2021-03-04 15:54:01 150 1

原创杭电Oj-Problem-1091

#include <iostream>using namespace std;int main(){ int A,B; cin>>A>>B; while(A!=0||B!=0){ cout<<A+B<<endl; cin>>A>>B; } }

2021-03-04 12:20:51 103 1

原创杭电Problem-1000,1089

#include <iostream>using namespace std;int main(){ int A,B; while(cin>>A>>B){ int C=A+B; cout<<C<<endl; } }

2021-03-01 20:42:30 66

原创杭电Problem-1090

#include <iostream>using namespace std;int main(){ int A,B,C; cin >> C; for(int i = 0;i < C;i++){ cin>>A>>B; int D=A+B; cout<<D<<endl; } }

2021-03-01 20:38:49 52

原创回文数-力扣

力扣-回文数class Solution {public: bool isPalindrome(int x) { int y; int tag = 1; if(x<0) tag = 0; else y = x; int z = x; int sum = 1; int rev[32];

2021-01-20 18:01:14 111 1

原创力扣-整数翻转

整数翻转Reverse IntegerReverse Integer示例思路判断是否溢出要点题目来源完整代码第一次写博客Reverse Integer给出一个 32 位的有符号整数，你需要将这个整数中每位上的数字进行反转。注意：假设我们的环境只能存储得下 32 位的有符号整数，则其数值范围为 [−231, 231 − 1]。请根据这个假设，如果反转后整数溢出那么就返回 0。Given a signed 32-bit integer x, return x with its digits reve

2021-01-19 21:55:19 108

weixin_42184953的博客