| package main | |
| import "fmt" | |
| func sumElement(n int, total *int) { | |
| if n == 0 { | |
| return | |
| } | |
| var element int |
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <script src="https://ajax.googleapis.com/ajax/libs/jquery/1.12.0/jquery.min.js"></script> | |
| <script> | |
| $(document).ready(function(){ | |
| $("button").click(function(){ | |
| $.post("http://hdechalange-solve.appspot/challenge/003/endpoint", | |
| { | |
| id: "id103019" |
| /build |
You can use this class to realize a simple sectioned grid RecyclerView.Adapter without changing your code.
The RecyclerView has to use a GridLayoutManager.
This is a porting of the class SimpleSectionedListAdapter provided by Google
If you are looking for a sectioned list RecyclerView.Adapter you can take a look here
| /* | |
| * Copyright 2014 Chris Banes | |
| * | |
| * Licensed under the Apache License, Version 2.0 (the "License"); | |
| * you may not use this file except in compliance with the License. | |
| * You may obtain a copy of the License at | |
| * | |
| * http://www.apache.org/licenses/LICENSE-2.0 | |
| * | |
| * Unless required by applicable law or agreed to in writing, software |
| /* Doubly Linked List implementation */ | |
| #include<stdio.h> | |
| #include<stdlib.h> | |
| struct Node { | |
| int data; | |
| struct Node* next; | |
| struct Node* prev; | |
| }; |
| package com.example.firebasefcmappkilled.payment | |
| import android.app.Activity | |
| import android.os.Bundle | |
| import androidx.appcompat.app.AppCompatActivity | |
| import com.example.firebasefcmappkilled.R | |
| import kotlinx.android.synthetic.main.activity_get_walletmix_trans_res.* | |
| class GetWalletmixTransResActivity : Activity() { |
| static void reverse(int a[], int n) | |
| { | |
| int i, k, t; | |
| for (i = 0; i < n / 2; i++) { | |
| t = a[i]; | |
| a[i] = a[n - i - 1]; | |
| a[n - i - 1] = t; | |
| } | |
| /** | |
| * | |
| * @author scode | |
| */ | |
| public class CountOnes4mString { | |
| // Returns count of n length binary | |
| // strings with consecutive 1's | |
| static int countStrings(int n) { | |
| int a[] = new int[n], b[] = new int[n]; |
