上一页 1 2 3 4 5 6 7 8 9 10 ··· 17 下一页
摘要: 题目: ![](https://img2023.cnblogs.com/blog/2679751/202309/2679751-20230904193121227-601792358.png) ``` class Solution { public: int hammingWeight(uint32 阅读全文
posted @ 2023-09-04 19:32 孜孜不倦fly 阅读(2) 评论(0) 推荐(0) 编辑
摘要: 题目: ![](https://img2023.cnblogs.com/blog/2679751/202309/2679751-20230903195408788-1159438784.png) ![](https://img2023.cnblogs.com/blog/2679751/202309/ 阅读全文
posted @ 2023-09-03 19:56 孜孜不倦fly 阅读(2) 评论(0) 推荐(0) 编辑
摘要: 题目: ![](https://img2023.cnblogs.com/blog/2679751/202309/2679751-20230903111447297-1731041087.png) ``` class Solution { public: vector> findContinuousS 阅读全文
posted @ 2023-09-03 11:22 孜孜不倦fly 阅读(1) 评论(0) 推荐(0) 编辑
摘要: 题目: ![](https://img2023.cnblogs.com/blog/2679751/202309/2679751-20230903100813764-1579439104.png) ``` class Solution { public: int majorityElement(vec 阅读全文
posted @ 2023-09-03 10:09 孜孜不倦fly 阅读(1) 评论(0) 推荐(0) 编辑
摘要: 题目: class Solution { //本题单纯找规律,要注意通过n%digits来判断有几个位数为digits的数 public: int findNthDigit(int n) { long base = 9, digits = 1; //digits代表位数 while(n-base*d 阅读全文
posted @ 2023-09-02 21:04 孜孜不倦fly 阅读(1) 评论(0) 推荐(0) 编辑
摘要: 题目: ![](https://img2023.cnblogs.com/blog/2679751/202309/2679751-20230902194907472-1661771290.png) ``` class Solution { public: int maxSubArray(vector& 阅读全文
posted @ 2023-09-02 19:54 孜孜不倦fly 阅读(1) 评论(0) 推荐(0) 编辑
摘要: 题目: ![](https://img2023.cnblogs.com/blog/2679751/202309/2679751-20230901202113801-1638700230.png) ``` class Solution { //本题用贪心算法,拆成尽可能多的3且不可以出现长度为1的小段 阅读全文
posted @ 2023-09-01 20:26 孜孜不倦fly 阅读(1) 评论(0) 推荐(0) 编辑
摘要: **一.打印np数组** ``` import numpy as np arr = np.array([13, 2500]) print(np.shape(arr)) ``` **二.打印tensor张量** ``` import torch arr = torch.Tensor([[1, 2, 3 阅读全文
posted @ 2023-08-31 22:27 孜孜不倦fly 阅读(46) 评论(0) 推荐(0) 编辑
摘要: 题目: ![](https://img2023.cnblogs.com/blog/2679751/202308/2679751-20230831214433091-1952227654.png) ``` class Solution { public: int cuttingRope(int n) 阅读全文
posted @ 2023-08-31 21:53 孜孜不倦fly 阅读(2) 评论(0) 推荐(0) 编辑
摘要: 题目: class Solution { public: vector<int> constructArr(vector<int>& a) { int len = a.size(); if(len==0) return {}; vector<int> b(len, 1); for(int i=1;i 阅读全文
posted @ 2023-08-31 20:45 孜孜不倦fly 阅读(3) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 9 10 ··· 17 下一页