- 博客(7)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 66. Plus One
题目描述Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.You may assume the integer do not contain any leading zero, except the number 0 itself.The digits ar
2017-06-25 17:56:03
232
原创 80. Remove Duplicates from Sorted Array II
题目描述Follow up for “Remove Duplicates”: What if duplicates are allowed at most twice?For example, Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first five el
2017-06-23 14:37:41
220
原创 26. Remove Duplicates from Sorted Array
题目描述Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with
2017-06-22 18:49:56
217
原创 27. Remove Element
题目描述Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.The o
2017-06-22 17:17:32
195
原创 大一上个人信息管理课程设计
#include "stdafx.h"#include<stdio.h>#include<string.h>#include<windows.h>#define maxstudent 40//最大的学生数40typedef struct student{ int num; int classid; int year; char sex; char
2017-06-20 21:56:00
384
原创 c++ 求期望方差
#include<iostream>#include<cmath>using namespace std;int main(){ double a[100], sum = 0, expect = 0, variance = 0; int n; scanf("%d",&n); for(int i = 0; i < n; i++) { sc
2017-06-13 20:05:06
2122
原创 01背包
#include<iostream>using namespace std;int max(int a, int b){ if(a > b) return a; else return b;}int main(){ int t, n, v,k, i; int c[1000], w[1000]; int f[1000]
2017-06-02 02:15:53
181
鸟哥的linux私房菜
2017-10-15
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人