Esempio n. 1
0
        public void GetBytes()
        {
            var lfss = new LocalFileSystemProvider.LocalFileSystemProviderSettings();

            lfss.BasePath = @"c:\temp\LocalFileSystemProviderTestsDir\";
            var lfs = new LocalFileSystemProvider(lfss);

            VirtualFsHost.MountDrive("local", lfs);

            var r = VDictionary.ReadAllBytes(@"local:\test.txt");

            Assert.IsNotNull(r);

            VirtualFsHost.UnMountDrive("local");
        }
        public static int GetNumOfSubArrays(int[] array, int k)
        {
            int sum = 0;
            var dic = new VDictionary <int, int>();

            dic[0] = 1;

            int num = 0;

            for (int i = 0; i < array.Length; i++)
            {
                sum += array[i];
                num += dic[sum - k];
                dic[sum]++;
            }

            return(num);
        }
Esempio n. 3
0
        public static long GetNum(long[] array, int k)
        {
            var dic1 = new VDictionary <long, long>();
            var dic2 = new VDictionary <long, long>();

            dic1[0] = 1;
            dic2[0] = 1;

            long sum1 = 0;
            long sum2 = 0;
            long res  = 0;

            for (int i = 1; i < array.Length; i++)
            {
                if (i % 2 == 1)
                {
                    sum1 += array[i] * array[i - 1];
                    res  += dic1[sum1 - k];
                    dic1[sum1]++;
                }
                else
                {
                    sum2 += array[i] * array[i - 1];
                    res  += dic2[sum2 - k];
                    dic2[sum2]++;
                }
            }

            sum1 = 0;
            sum2 = 0;
            dic1.Clear();
            dic2.Clear();

            dic1[0] = 1;
            dic2[0] = 1;

            if (array[0] == k)
            {
                res++;
            }
            if (array[1] == k)
            {
                res++;
            }

            for (int i = 2; i < array.Length; i++)
            {
                if (i % 2 == 1)
                {
                    sum1 += array[i - 1] * array[i - 2];
                    dic1[sum1]++;
                    res += dic1[sum1 + array[i] - k];
                }
                else
                {
                    sum2 += array[i - 1] * array[i - 2];
                    dic2[sum2]++;
                    res += dic2[sum2 + array[i] - k];
                }
            }

            return(res);
        }