返回顶部
上一页 1 ··· 3 4 5 6 7
摘要: 不得不吐槽下visual studio真是越来越大了。我的盘子表示鸭梨很大。于是乎,我遇见了vscode。 嘿嘿,再见Visual studio。 但是,vscode让人非常想吐槽的就是配置。。。因此在成功生成第一个exe文件后,我决定记录下这次成功的经历。 在此感谢JaJaCube,感谢大佬的教程 阅读全文
posted @ 2019-07-19 23:08 Swetchine 阅读(11535) 评论(0) 推荐(1) 编辑
摘要: Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. Given an array of size  阅读全文
posted @ 2019-07-14 22:47 Swetchine 阅读(114) 评论(0) 推荐(0) 编辑
摘要: Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Given an array of integers where 阅读全文
posted @ 2019-07-14 21:14 Swetchine 阅读(106) 评论(0) 推荐(0) 编辑
摘要: Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. Given an array n 阅读全文
posted @ 2019-07-13 14:27 Swetchine 阅读(105) 评论(0) 推荐(0) 编辑
摘要: You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that a 阅读全文
posted @ 2019-07-10 01:01 Swetchine 阅读(183) 评论(0) 推荐(0) 编辑
摘要: Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Example 2: Example 3: 阅读全文
posted @ 2019-07-10 00:51 Swetchine 阅读(120) 评论(0) 推荐(0) 编辑
摘要: Invert a binary tree. Example: Input: Output: 方法2:递归求解,简洁的让人觉得可怕,跑的还飞快,推荐食用👍 阅读全文
posted @ 2019-07-10 00:31 Swetchine 阅读(167) 评论(0) 推荐(0) 编辑
摘要: We have an array A of integers, and an array queries of queries. For the i-th query val = queries[i][0], index = queries[i][1], we add val to A[index] 阅读全文
posted @ 2019-07-09 01:31 Swetchine 阅读(137) 评论(0) 推荐(0) 编辑
摘要: Given an array A of integers, for each integer A[i] we may choose any x with -K <= x <= K, and add x to A[i]. After this process, we have some array B 阅读全文
posted @ 2019-07-09 01:20 Swetchine 阅读(121) 评论(0) 推荐(0) 编辑
上一页 1 ··· 3 4 5 6 7