2018年12月_anvqxl0105

转载 115th LeetCode Weekly Contest Check Completeness of a Binary Tree

Given a binary tree, determine if it is acomplete binary tree.Definition of a complete binary tree fromWikipedia:In a complete binary tree every level, except possibly the last, is completely...

2018-12-24 21:31:00 92

转载 115th LeetCode Weekly Contest Prison Cells After N Days

There are 8 prison cells in a row, and each cell is either occupied or vacant.Each day, whether the cell is occupied or vacant changes according to the following rules:If a cell has two adj...

2018-12-24 21:28:00 88

转载 XAML 绑定和结构体不得不说的问题

遇见一个问题如果用一个结构体struct。再用一个ListView，然后使用绑定。<Window x:Class="WpfApp1.MainWindow" xmlns="http://schemas.microsoft.com/winfx/2006/xaml/presentation" xmlns:x="http://schema...

2018-12-24 15:47:00 117

转载 C# 检查键盘是否唤醒到桌面上显示

大概需要的win32函数public static extern IntPtr FindWindow(string lpClassName, string lpWindowName)//返回值为具有指定类名和窗体名的窗体句柄//软键盘的类名有很多，以IPTIP_Main_Window为例子public static extern int GetWindowLong(I...

2018-12-24 10:47:00 255

转载 116th LeetCode Weekly Contest Maximum Width Ramp

Given an arrayAof integers, arampis a tuple(i, j)for whichi < jandA[i] <= A[j]. The width of such aramp isj - i.Find the maximum width of a ramp inA. If one doesn't exist, r...

2018-12-24 00:14:00 81

转载 116th LeetCode Weekly Contest N-Repeated Element in Size 2N Array

In a arrayAof size2N, there areN+1unique elements, and exactly one of these elements is repeated N times.Return the element repeatedNtimes.Example 1:Input: [1,2,3,3]Output: 3...

2018-12-24 00:07:00 71

转载简单探究一下window下的wifi各种东西

保存地方在哪里C:\ProgramData\Microsoft\Wlansvc\Profiles\InterfacesHKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Wlansvc\Interfaces里面对每一个网卡保存了xml文件，里面都是保存过的密码信息，至于何种加密得看wifi自己打开一个看看name和SSID可以不同...

2018-12-13 11:58:00 289

转载 114th LeetCode Weekly Contest Array of Doubled Pairs

Given an array of integersAwith even length, returntrueif and only if it is possible to reorder it such thatA[2 * i + 1] = 2 * A[2 * i]for every0 <=i < len(A) / 2.Example 1...

2018-12-09 19:32:00 80

转载 113th LeetCode Weekly Contest Reveal Cards In Increasing Order

In a deck of cards, every card has a unique integer. You can order the deck inany order you want.Initially, all the cards start face down (unrevealed) in one deck.Now, you do the following ...

2018-12-02 21:13:00 62

转载 113th LeetCode Weekly Contest Flip Equivalent Binary Trees

For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.A binary tree Xisflip equivalentto a binary tree Y if and only if ...

2018-12-02 21:12:00 74

转载 113th LeetCode Weekly Contest Largest Time for Given Digits

Given an array of 4 digits, return the largest 24 hour time that can be made.The smallest 24 hour time is 00:00, and the largest is 23:59. Starting from 00:00, a time is larger if more time ha...

2018-12-02 21:07:00 72

转载 2018年江西理工大学C语言程序设计竞赛(初级组)一

C语言竞赛初级组第一、二场答案：https://www.cnblogs.com/xingkongyihao/p/10046918.htmlA: 逆序对时间限制:1 s 内存限制:128 MB题目描述1.整数序列中两个相邻的数，如果后面的数小于前面的数，则称这两个数值构成了一个逆序对。例如，整数序列10，4，16，8，21，18，9...

2018-12-01 12:47:00 363