static int LargestProduct(arr Array) {for (i = 0; i < Array.GetLength(0); i++ ) { for (k = 0; k < Array.Length(1); k++) { if (Array[i,k]*Array[i, k+1] > max) { int max = Array[i, k] * Array[i, k + 1};
/* Driver method */ public static void Main() { int n, i; Console.WriteLine("Enter your Array length"); n = Console.ReadLine(); int [] arr = new arr[n]; for (i = 0; i <= n; i++) { Console.WriteLine("Enter your elements one by one");
public void TestMethod1() { var modelIdNull = new arr(); var modelIdNotNull = new arr { Id = 112314, MyProperty = "muh" }; var docIdNull = new JsonApiCollectionDocument <arr>(modelIdNull); var docIdNotNull = new JsonApiCollectionDocument <arr>(modelIdNotNull); var jsonIdNull = JsonConvert.SerializeObject(docIdNull); var jsonIdNotNull = JsonConvert.SerializeObject(docIdNotNull); var resultIdNull = JsonConvert.DeserializeObject <arr>(jsonIdNull); var resultIdNotNull = JsonConvert.DeserializeObject <arr>(jsonIdNotNull); }
public static arr Frequency(Word X) { arr res = new arr(); res.val = new float[m2]; res.idx = new int[m2]; for (int i = 0; i < X.word.Length; i++) { res.val[X.word[i]]++; } for (int i = 0; i < m2; i++) { res.val[i] = res.val[i] / X.word.Length; res.idx[i] = i; } for (int i = 1; i < res.val.Length; i++) { float cur = res.val[i]; int cur_idx = res.idx[i]; int j = i; while (j > 0 && cur < res.val[j - 1]) { res.val[j] = res.val[j - 1]; res.idx[j] = res.idx[j - 1]; j--; } res.val[j] = cur; res.idx[j] = cur_idx; } Array.Reverse(res.val); Array.Reverse(res.idx); arr shortres = new arr(); shortres.val = new float[5]; shortres.idx = new int[5]; for (int i = 0; i < 5; i++) { shortres.val[i] = res.val[i]; shortres.idx[i] = res.idx[i]; } //return shortres.idx; return(shortres); }
if (conditions(arr[i])) { return(arr[i], i);
public static (T item, int idx) LookUp <T>(this T[] arr, Predicate <T> conditions)
return(FindFirstOccurrenceOfSet(arr, set, 0, arr.Length));
callBack(arr[i]);
return search(arr);
Añadir(arr, numero);
public static (int index, T max) MaxBy <T>(this T[] arr) where T : IComparable <T>
return(ExecuteForeach(arr, sortDirect));
() => InnerSort(arr[mid..], temp[mid..]));
buckets[arr[i].ToInt32(default) / NumberOfBuckets].Add(arr[i]);
public storage(Stream arr) => storingShit = new BinaryReader(arr, Encoding.Unicode);
public static (int index, T min) MinBy <T>(this T[] arr) where T : IComparable <T>
public HttpResponseMessage AddEPToGiuongAuto([FromBody] arr values) { //return null; using (var db = new DB()) { results <KTX0020> rels = new results <KTX0020> (); var li = values.arrPhong.ToList().Select(p => p.KTX0001_ID).ToList(); var listgiuong = (from t in db.KTX0002 where li.Contains(t.KTX0001_ID) && t.trangthai == false select t).ToList(); for (int i = 0; i < values.EPs.Length; i++) { result <KTX0020> rel = new result <KTX0020>(); if (i < listgiuong.Count) { if (values.EPs[i].KTX0002_ID == null) { int idd = values.EPs[i].KTX0020_ID; var check = (from temp in db.KTX0020 where temp.KTX0020_ID == idd select temp).FirstOrDefault(); if (check != null && check.KTX0002_ID == null) { int idg = listgiuong[i].KTX0002_ID; var ktx02 = db.KTX0002.SingleOrDefault(p => p.KTX0002_ID == idg); var chiakhoa = (from chia in db.KTX0003 where (chia.trangthai == false || chia.trangthai == null) && chia.KTX0001_ID == ktx02.KTX0001_ID select chia).FirstOrDefault(); var ktx1 = db.KTX0001.SingleOrDefault(p => p.KTX0001_ID == ktx02.KTX0001_ID); check.khoaphong = ktx1 != null ? ktx1.makhoa : ""; values.EPs[i].khoaphong = check.khoaphong; check.KTX0002_ID = ktx02.KTX0002_ID; check.KTX0001_ID = ktx02.KTX0001_ID; if (chiakhoa != null) { check.KTX0003_ID = chiakhoa.KTX0003_ID; check.sokhoatu = chiakhoa.MaKhoa; check.sotu = chiakhoa.SoTu; values.EPs[i].KTX0003_ID = chiakhoa.KTX0003_ID; values.EPs[i].sokhoatu = chiakhoa.MaKhoa; values.EPs[i].sotu = chiakhoa.SoTu; chiakhoa.trangthai = true; } try { db.SaveChanges(); ktx02.trangthai = true; db.SaveChanges(); values.EPs[i].KTX0001_ID = ktx02.KTX0001_ID; values.EPs[i].KTX0002_ID = ktx02.KTX0002_ID; rel.set("OK", values.EPs[i], "Thành công"); } catch (Exception d) { rel.set("ERR", values.EPs[i], "Thất bại: " + d.Message); } } else if (check != null) { var kk = db.KTX0002.FirstOrDefault(p => p.KTX0002_ID == check.KTX0002_ID); rel.set("ERR", values.EPs[i], "Thất bại: Người này đã ở một giường khác mã: " + (kk != null ? kk.ten : "")); } } else { //người này đã có giường rồi rel.set("ERR", values.EPs[i], "Thất bại: người này đã có giường rồi"); } } else { } rels.add(rel); } return(rels.ToHttpResponseMessage()); } }
public static (int, int) IndexOfIncludeNull <T>(this T[,] arr, T of) => IndexOf(arr, f => f.Equals(of));
return(mid > 0 ? Merge(MergeSort(arr[..mid]), MergeSort(arr[mid..])) : arr);
sums[l..r].Should().Be(arr[l..r].Sum());
var(arr, expected) = scenarios;
public static (T Value, int Index, bool success) Find <T>(this T[] arr, Func <T, int, bool> predicate2)
Console.WriteLine(Totuple(arr, l));
public static string twoSum(arr, S) { int[] sums = [];
public static void run(arr fn, int x, int y) { fn(x, y); }
//Non-mvp: Test this /// <returns>A pair indicating the first element found and its index, or (-1, default) if nothing found.</returns> public static (int index, T element) FindFirstOccurrenceOfSet <T>(this T[] arr, ISet <T> set)