C++学习
a694262054
这个作者很懒,什么都没留下…
展开
-
const指针的引用
http://bbs.csdn.net/topics/310047017const用法详解http://bbs.csdn.net/topics/3100076101)对于非指针引用的形参,如fun1,传入非const实参没问题,如fun1(a)但对于指针引用的形参,如fun,传入非const实参却有问题,如fun(b),而传入转载 2017-04-15 15:00:27 · 274 阅读 · 0 评论 -
Leetcode 练习9 回文数
https://leetcode.com/problems/palindrome-number/class Solution {public: bool isPalindrome(int x) { vector <int> num; int temp; if (x<0) ret...原创 2019-05-24 01:11:48 · 233 阅读 · 0 评论 -
Leetcode 练习303 Range Sum Query - Immutable
https://leetcode.com/problems/range-sum-query-immutable/class NumArray { vector<int> sums;public: NumArray(vector<int>& nums) { if (nums.size()>0) ...原创 2019-05-23 22:02:40 · 122 阅读 · 0 评论 -
Leetcode 练习198 House Robber
https://leetcode.com/problems/house-robber/class Solution {public: int rob(vector<int>& nums) { if (nums.size()==0) return 0; if (nums.size()==...原创 2019-05-23 21:22:31 · 128 阅读 · 0 评论 -
Leetcode 练习121 Best Time to Buy and Sell Stock
https://leetcode.com/problems/best-time-to-buy-and-sell-stock/class Solution {public: int maxProfit(vector<int>& prices) { if (prices.size()<2) return ...原创 2019-05-23 19:54:26 · 134 阅读 · 0 评论 -
Leetcode 练习70 爬梯子
https://leetcode.com/problems/climbing-stairs/class Solution {public: int climbStairs(int n) { if (n==1) return 1; if (n==2) return 2; ...原创 2019-05-23 19:35:04 · 154 阅读 · 0 评论 -
Leetcode 练习66 plus one
https://leetcode.com/problems/plus-one/class Solution {public: vector<int> plusOne(vector<int>& digits) { int length=digits.size(); digits[length-1]=...原创 2019-05-23 19:04:38 · 122 阅读 · 0 评论 -
Leetcode 练习 53 最大子串
https://leetcode.com/problems/maximum-subarray/class Solution {public: int maxSubArray(vector<int>& nums) { long long temp=0, sums=INT_MIN; for (int i=0; i...原创 2019-05-23 17:06:58 · 250 阅读 · 0 评论 -
Leetcode 练习 35.找到插入位置
https://leetcode.com/problems/search-insert-position/class Solution {public: int searchInsert(vector<int>& nums, int target) { int i; int flag=0; for ( i=0;...原创 2019-05-23 16:15:14 · 137 阅读 · 0 评论 -
Leetcode 练习 去除元素
https://leetcode.com/problems/remove-element/class Solution {public: int removeElement(vector<int>& nums, int val) { int front =0; for (int i=0; i< nums.s...原创 2019-05-23 16:13:22 · 128 阅读 · 0 评论 -
LeetCode记录 去除有序数组中的重复值
https://leetcode.com/problems/remove-duplicates-from-sorted-array/class Solution {public: int removeDuplicates(vector<int>& nums) { if (nums.size()==0) ...原创 2019-05-23 15:47:27 · 271 阅读 · 0 评论 -
LeetCode记录 第一题 两数之和
https://leetcode.com/problems/two-sum/class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { int i,j,len; vector<int> res(2,0); ...原创 2019-05-23 11:55:50 · 115 阅读 · 0 评论 -
LeetCode记录第二题 整数翻转
//https://leetcode.com/problems/reverse-integer/class Solution {public: int reverse(int x) { if (x==0) { return 0; } long long a=x, ...原创 2019-05-23 11:49:13 · 114 阅读 · 0 评论 -
Leetcode 练习 14. Longest Common Prefix
https://leetcode.com/problems/longest-common-prefix/class Solution {public: string longestCommonPrefix(vector<string>& strs) { int n=0; i...原创 2019-05-24 16:09:36 · 183 阅读 · 0 评论 -
LeetCode 练习13. Roman to Integer
https://leetcode.com/problems/roman-to-integer/class Solution {public: int romanToInt(string s) { int outs=0, last=1003; for(auto bt : s) {...原创 2019-05-24 14:50:19 · 136 阅读 · 0 评论 -
Leetcode 练习746 Min Cost Climbing Stairs
https://leetcode.com/problems/min-cost-climbing-stairs/class Solution {public: int minCostClimbingStairs(vector<int>& cost) { if (cost.size()<3) ret...原创 2019-05-24 14:22:54 · 138 阅读 · 0 评论 -
LeetCode 练习 67. Add Binary
https://leetcode.com/problems/add-binary/class Solution {public: string addBinary(string a, string b) { string outs; int lena=a.size(), lenb=b.size(),leng,lende; ...原创 2019-06-02 21:17:31 · 178 阅读 · 0 评论